A limit theorem for set of subwords in deterministic TOL laguages
From MaRDI portal
Publication:1215275
DOI10.1016/0020-0190(73)90003-3zbMath0299.68044MaRDI 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
68Q45: Formal languages and automata
Related Items
Another generalization of abelian equivalence: binomial complexity of infinite words, 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, On generalized DT0L systems and their fixed points, Comparing Complexity Functions of a Language and Its Extendable Part, Unnamed Item, Subword complexities of various classes of deterministic developmental languages with interactions
Cites Work