Balance of many-valued transductions and equivalence problems

DOI10.1016/0304-3975(86)90151-9zbMath0632.68076OpenAlexW2044042167MaRDI QIDQ1095671

Amiram Yehudai, Yael Maon

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90151-9

zbMATH Keywords

equivalenceregular languagesrational transductionsbalance of two morphisms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

On the equivalence of some transductions involving letter to letter morphisms on regular languages ⋮ On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages

Cites Work

• On the equivalence of some transductions involving letter to letter morphisms on regular languages
• Inverse morphic equivalence on languages
• On test sets for checking morphism equivalence on languages with fair distribution of letters
• Test sets and checking words for homomorphism equivalence
• On the decidability of the sequence equivalence problem for DOL-systems
• On the decidability of homomorphism equivalence for languages
• Some decidability results about regular and pushdown translations
• A simple undecidable problem: Existential agreement of inverses of two morphisms on a regular language
• Equality languages and fixed point languages
• Alternation
• The decidability of the equivalence problem for DOL-systems
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Balance of many-valued transductions and equivalence problems