On generalized DT0L systems and their fixed points

DOI10.1016/0304-3975(94)90043-4zbMath0824.68059OpenAlexW1983022850MaRDI QIDQ1342236

Juha Honkala

Publication date: 6 November 1995

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90043-4

zbMATH Keywords

DT0L languagesDT0L systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

On the equivalence problem of context-free and DT0L languages ⋮ On morphically generated formal power series

Cites Work

• L codes and number systems
• A morphic representation of EOL languages and other ETOL languages
• The decidability of the DOL-DTOL equivalence problem
• A limit theorem for set of subwords in deterministic TOL laguages
• Subword complexities of various classes of deterministic developmental languages without interactions
• On the number of subwords of everywhere growing DTOL languages
• A note on language equations involving morphisms
• On D0L systems with immigration
• A Morphic Representation of Complements of Recursively Enumerable Sets
• Description of developmental languages using recurrence systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On generalized DT0L systems and their fixed points