A New Proof for the Dol Sequence Equivalence Problem and its Implications
- 1 January 1986
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- The ω sequence problem for DOL systems is decidableJournal of the ACM, 1984
- On the Ehrenfeucht conjecture for DOL languagesRAIRO. Informatique théorique, 1983
- 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
- On the equality sets for homomorphisms on free monoids with two generatorsRAIRO. Informatique théorique, 1980
- A Purely Homomorphic Characterization of Recursively Enumerable SetsJournal of the ACM, 1979
- On simple representations of language familiesRAIRO. Informatique théorique, 1979
- The ultimate equivalence problem for DOL systemsActa Informatica, 1978
- The decidability of the equivalence problem for DOL-systemsInformation and Control, 1977
- On the decidability of the sequence equivalence problem for DOL-systemsTheoretical Computer Science, 1976