Concentration dependent OL systems

DOI10.1080/00207167908803171zbMath0453.68042OpenAlexW2086888416MaRDI QIDQ3901009

Juergen Dassow

Publication date: 1979

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207167908803171

zbMATH Keywords

decision problemshomomorphismsgrowth functionsregulated rewritinggenerative powerL systemsdevelopmental languagesdeterministic tabled OL systemnonterminals

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Information transmission in il systems^∗

Cites Work

• Unnamed Item
• Priorities on context conditions in rewriting systems
• Nonterminals, homomorphisms and codings in different variations of OL- systems. II: Nondeterministic systems
• Some properties of the class of \(L\) languages with interactions
• The length sets of D0L languages are uniformly bounded
• DOL sequences
• The equivalence problem for deterministic TOL-systems is undecidable
• On the synthesis of DOL growth
• On the decidability of some equivalence problems for DOL-systems
• On the periodicity of word-length in DOL languages

This page was built for publication: Concentration dependent OL systems