Recurrent words and simultaneous growth in T0L systems

DOI10.1016/0304-3975(85)90002-7zbMath0601.68047DBLPjournals/tcs/LangeW85OpenAlexW1968457586WikidataQ54310016 ScholiaQ54310016MaRDI QIDQ1081308

Ermo Welzl, Klaus-Joern Lange

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90002-7

zbMATH Keywords

decidabilityPSPACE-hardET0L languageMarkov DT0L systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The membership question for ETOL-languages is polynomially complete
• Intercalation lemmas for tree transducer languages
• Complexity of some problems concerningL systems
• Life and death in Markov deterministic tabled OL systems
• A note on recurrent words

This page was built for publication: Recurrent words and simultaneous growth in T0L systems