Homomorphism equivalence on etol languages†
From MaRDI portal
Publication:4185823
DOI10.1080/00207167908803155zbMath0401.68049OpenAlexW1965663889MaRDI QIDQ4185823
Jean-Luc Richier, Karel II Culik
Publication date: 1979
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207167908803155
Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
Test sets and checking words for homomorphism equivalence, 2DST mappings of languages and related problems, On test sets for checking morphism equivalence on languages with fair distribution of letters
Cites Work
- Unnamed Item
- Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems
- On the decidability of the sequence equivalence problem for DOL-systems
- The ultimate equivalence problem for DOL systems
- The decidability of the equivalence problem for DOL-systems
- Indexed Grammars—An Extension of Context-Free Grammars
- Programmed Grammars and Classes of Formal Languages