Inverse morphic equivalence on languages
From MaRDI portal
Publication:1061490
DOI10.1016/0020-0190(84)90055-3zbMath0571.68061MaRDI QIDQ1061490
Publication date: 1984
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(84)90055-3
68Q45: Formal languages and automata
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, Representations of language families by homomorphic equality operations and generalized equality sets, A simple undecidable problem: Existential agreement of inverses of two morphisms on a regular language, Unnamed Item, On some transducer equivalence problems for families of languages
Cites Work
- Systems of equations over a free monoid and Ehrenfeucht's conjecture
- On binary equality sets and a solution to the test set conjecture in the binary case
- A homomorphic characterization of regular languages
- A note on morphic characterization of languages
- An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations
- On the decidability of homomorphism equivalence for languages
- Some decidability results about regular and pushdown translations
- A homomorphic characterization of principal semi AFLs without using intersection with regular sets
- Checking sets, test sets, rich languages and commutatively closed languages
- Rational sets in commutative monoids
- Test sets for context free languages and algebraic systems of equations over a free monoid
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
