DOL sequences

DOI10.1016/0012-365X(74)90043-0zbMath0287.68052MaRDI QIDQ1846338

Grzegorz Rozenberg

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Formal languages and automata (68Q45)

Related Items

Subword complexities of various classes of deterministic developmental languages with interactions, A limit theorem for set of subwords in deterministic TOL laguages, Ambiguity in the developmental systems of Lindenmayer, Subword complexities of various classes of deterministic developmental languages without interactions, On the number of subwords of everywhere growing DTOL languages, EOL languages are not codings of FPOL languages, Concentration dependent OL systems, The length sets of D0L languages are uniformly bounded

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Development systems with locally catenative formulas
• Characterization of unary developmental languages
• Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology
• The equivalence problem for deterministic TOL-systems is undecidable
• TOL systems and languages
• A note on some systems of lindenmayer
• I. General description and the problem of universal computing ability
• On 0L-Languages
• Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation