Structural complexity 1
On the language of primitive words
Theoretical Computer Science
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Ambiguity of Primitive Words
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Hierarchies of memory limited computations
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Roots and powers of regular languages
DLT'02 Proceedings of the 6th international conference on Developments in language theory
| Hi-index | 0.00 |
The root of a language L is the set of all primitive words p such that pn belongs to L for some n 驴 1. We show that the gap between the time complexity and space complexity, respectively, of a language and that of its root can be arbitrarily great. From this we conclude that there exist regular languages the roots of which are not even context-sensitive. Also we show that the quadratic time complexity for deciding the set of all primitive words by an 1-tape Turing machine is optimal.