On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages

DOI10.1016/0304-3975(85)90063-5zbMath0585.68071OpenAlexW2044892143MaRDI QIDQ1070829

Yael Maon

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)90063-5

zbMATH Keywords

decidability

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On some transducer equivalence problems for families of languages ⋮ On the equivalence of some transductions involving letter to letter morphisms on regular languages

Cites Work

• The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
• On the equivalence of some transductions involving letter to letter morphisms on regular languages
• Inverse morphic equivalence on languages
• Balance of many-valued transductions and equivalence problems
• On the decidability of homomorphism equivalence for languages
• Some decidability results about regular and pushdown translations
• Unnamed Item
• Unnamed Item
• Unnamed Item