On the equivalence of some transductions involving letter to letter morphisms on regular languages
From MaRDI portal
Publication:1058303
DOI10.1007/BF00288471zbMath0564.68056MaRDI QIDQ1058303
Publication date: 1986
Published in: Acta Informatica (Search for Journal in Brave)
68Q45: Formal languages and automata
03D40: Word problems, etc. in computability and recursion theory
Related Items
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, Balance of many-valued transductions and equivalence problems, The undecidability of some equivalence problems concerning ngsm's and finite substitutions, A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\), Unnamed Item, On some transducer equivalence problems for families of languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On some decision questions concerning pushdown machines
- Systems of equations over a free monoid and Ehrenfeucht's conjecture
- On the equivalence of some transductions involving letter to letter morphisms on regular languages
- Inverse morphic equivalence on languages
- On the equivalence problem of compositions of morphisms and inverse morphisms on context-free languages
- Balance of many-valued transductions and equivalence problems
- Single-valued a-transducers
- 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
- Test sets for context free languages and algebraic systems of equations over a free monoid
- The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
