The length sets of D0L languages are uniformly bounded
References (13)
D0L sequences
Discrete Mathematics
(1974)Indagat. Mathem.
(1973)Indagat. Mathem.
(1973)- et al.
Developmental systems and languages
(1974) - et al.
Formal languages and their relation to automata
(1969) J. Theor. Biology
(1968)
There are more references available in the full text version of this article.
Cited by (7)
DOL schemes and the periodicity of string embeddings
1988, Theoretical Computer ScienceHypercodes in deterministic and slender 0L languages
1980, Information and ControlOn the decidability of the OL-DOL equivalence problem
1979, Information and ControlOn the number of subwords of everywhere growing DTOL languages
1976, Discrete MathematicsSubword complexities of various classes of deterministic developmental languages without interactions
1975, Theoretical Computer ScienceSemi-Discrete Context-Free Languages†
1983, International Journal of Computer Mathematics
- ∗
All correspondence to this author.
Copyright © 1974 Published by Elsevier B.V.