On characterisation of language families in terms of inverse morphisms

DOI10.1080/00207168408803437zbMath0551.68062OpenAlexW2152290319MaRDI QIDQ3343457

Paavo Turakainen

Publication date: 1984

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168408803437

zbMATH Keywords

principal semi-AFL

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Reset machines
• A note on morphic characterization of languages
• A homomorphic characterization of principal semi AFLs without using intersection with regular sets
• Three theorems concerning principal AFLs
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• Reversal-Bounded Acceptors and Intersections of Linear Languages
• On some families of languages related to developmental systems
• Non-prinicipalité du cylindre des langages à compteur
• Le cylindre des langages linéaires
• The Hardest Context-Free Language
• Quasi-realtime languages
• One-way nondeterministic real-time list-storage languages

This page was built for publication: On characterisation of language families in terms of inverse morphisms