A note on language equations involving morphisms

DOI10.1016/0020-0190(78)90001-7zbMath0385.68058OpenAlexW2004468429MaRDI QIDQ1249436

Keijo Ruohonen

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0020-0190(78)90001-7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

On generalized DT0L systems and their fixed points ⋮ The decidability of the DOL-DTOL equivalence problem ⋮ Language equations ⋮ On morphically generated formal power series ⋮ A morphic representation of EOL languages and other ETOL languages

Cites Work

• The theory of well-quasi-ordering: a frequently discovered concept
• TOL schemes and control sets
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on language equations involving morphisms