The length sets of D0L languages are uniformly bounded
From MaRDI portal
Publication:1844083
DOI10.1016/0020-0190(74)90009-XzbMath0282.68037MaRDI QIDQ1844083
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
68Q45: Formal languages and automata
Related Items
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, Semi-discrete context-free languages†, Concentration dependent OL systems, Unnamed Item, Unnamed Item
Cites Work