On the Ehrenfeucht conjecture for DOL languages
Open Access
- 1 January 1983
- journal article
- Published by EDP Sciences in RAIRO. Informatique théorique
- Vol. 17 (3) , 205-230
- https://doi.org/10.1051/ita/1983170302051
Abstract
RAIRO - Theoretical Informatics and Applications, an international journal on theoretical computer science and its applicationsKeywords
This publication has 10 references indexed in Scilit:
- Systems of equations over a free monoid and Ehrenfeucht's conjectureDiscrete Mathematics, 1983
- Test sets for context free languages and algebraic systems of equations over a free monoidInformation and Control, 1982
- Test sets and checking words for homomorphism equivalenceJournal of Computer and System Sciences, 1980
- HOMOMORPHISMS: DECIDABILITY, EQUALITY AND TEST SETS1Published by Elsevier ,1980
- On the decidability of homomorphism equivalence for languagesJournal of Computer and System Sciences, 1978
- The ultimate equivalence problem for DOL systemsActa Informatica, 1978
- Automata-Theoretic Aspects of Formal Power SeriesPublished by Springer Nature ,1978
- On finite semigroups of matricesTheoretical Computer Science, 1977
- On the decidability of the sequence equivalence problem for DOL-systemsTheoretical Computer Science, 1976
- Rational sets in commutative monoidsJournal of Algebra, 1969