On the equality sets for homomorphisms on free monoids with two generators
Open Access
- 1 January 1980
- journal article
- Published by EDP Sciences in RAIRO. Informatique théorique
- Vol. 14 (4) , 349-369
- https://doi.org/10.1051/ita/1980140403491
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Test sets and checking words for homomorphism equivalenceJournal of Computer and System Sciences, 1980
- Equality languages and fixed point languagesInformation and Control, 1979
- A Purely Homomorphic Characterization of Recursively Enumerable SetsJournal of the ACM, 1979
- On simple representations of language familiesRAIRO. Informatique théorique, 1979
- On the homomorphic characterizations of families of languagesLecture Notes in Computer Science, 1979
- On the decidability of homomorphism equivalence for languagesJournal of Computer and System Sciences, 1978
- Elementary homomorphisms and a solution of the D0L sequence equivalence problemTheoretical Computer Science, 1978
- The decidability of the equivalence problem for DOL-systemsInformation and Control, 1977
- The equation $a^M=b^Nc^P$ in a free group.The Michigan Mathematical Journal, 1962