A limit theorem for set of subwords in deterministic TOL laguages

DOI10.1016/0020-0190(73)90003-3zbMath0299.68044OpenAlexW2075043804MaRDI QIDQ1215275

Andrzej Ehrenfeucht, Grzegorz Rozenberg

Publication date: 1973

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

Full work available at URL: https://doi.org/10.1016/0020-0190(73)90003-3

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

On generalized DT0L systems and their fixed points ⋮ Comparing Complexity Functions of a Language and Its Extendable Part ⋮ Subword complexities of various classes of deterministic developmental languages with interactions ⋮ Another generalization of abelian equivalence: binomial complexity of infinite words ⋮ Unnamed Item ⋮ EOL systems with control devices ⋮ Subword complexities of various classes of deterministic developmental languages without interactions ⋮ On the number of subwords of everywhere growing DTOL languages ⋮ Classes of formal grammars

Cites Work

• DOL sequences
• The equivalence problem for deterministic TOL-systems is undecidable
• Extension of tabled 0L-systems and languages
• TOL systems and languages
• Unnamed Item
• Unnamed Item

This page was built for publication: A limit theorem for set of subwords in deterministic TOL laguages