HDTOL matching of computations of multitape automata
- 1 November 1989
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 27 (2) , 179-191
- https://doi.org/10.1007/bf00265153
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The equivalence of finite valued transducers (on HDT0L languages) is decidableTheoretical Computer Science, 1986
- The inclusion problem for some classes of deterministic multitape automataTheoretical Computer Science, 1983
- Transductions and Context-Free LanguagesPublished by Springer Nature ,1979
- On the decidability of homomorphism equivalence for languagesJournal of Computer and System Sciences, 1978
- A new decidable problem, with applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- The equivalence problem for deterministic finite-turn pushdown automataInformation and Control, 1974
- The equivalence problem for deterministic two-tape automataJournal of Computer and System Sciences, 1973
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959