The equivalence of finite valued transducers (on HDT0L languages) is decidable
Open Access
- 31 December 1986
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 47, 71-84
- https://doi.org/10.1016/0304-3975(86)90134-9
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Test sets for finite substitutionsTheoretical Computer Science, 1986
- A proof of Ehrenfeucht's ConjectureTheoretical Computer Science, 1985
- 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
- The decidability of equivalence for deterministic finite transducersJournal of Computer and System Sciences, 1979
- Some decidability results about regular and pushdown translationsInformation Processing Letters, 1979
- On the decidability of homomorphism equivalence for languagesJournal of Computer and System Sciences, 1978
- Single-valued a-transducersJournal of Computer and System Sciences, 1977
- The decidability of the equivalence problem for DOL-systemsInformation and Control, 1977
- The equivalence problem for deterministic two-tape automataJournal of Computer and System Sciences, 1973