The length sets of D0L languages are uniformly bounded

DOI10.1016/0020-0190(74)90009-XzbMath0282.68037OpenAlexW2007281479MaRDI QIDQ1844083

Yanyan Li

Publication date: 1974

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(74)90009-x

zbMATH Keywords

formal languagesD0L sequencesL-systemslength sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Unnamed Item, DOL schemes and the periodicity of string embeddings, Subword complexities of various classes of deterministic developmental languages without interactions, On the number of subwords of everywhere growing DTOL languages, Concentration dependent OL systems, Semi-discrete context-free languages^†, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Development systems with locally catenative formulas
• DOL sequences
• Integral sequential word functions and growth equivalence of lindenmayer systems