On test sets for checking morphism equivalence on languages with fair distribution of letters
From MaRDI portal
Publication:1061491
DOI10.1016/0304-3975(84)90089-6zbMath0571.68062MaRDI QIDQ1061491
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90089-6
68Q45: Formal languages and automata
Related Items
Cites Work
- Systems of equations over a free monoid and Ehrenfeucht's conjecture
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
- On binary equality sets and a solution to the test set conjecture in the binary case
- Test sets and checking words for homomorphism equivalence
- On finite semigroups of matrices
- The ultimate equivalence problem for DOL systems
- On the decidability of homomorphism equivalence for languages
- Test sets for context free languages and algebraic systems of equations over a free monoid
- The decidability of the equivalence problem for DOL-systems
- Homomorphism equivalence on etol languages†
- Unnamed Item
- Unnamed Item
- Unnamed Item