Non-deterministic two-tape automata are more powerful than deterministic ones
- 19 November 2005
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- AutomatentheoriePublished by Springer Nature ,1984
- Transductions and Context-Free LanguagesPublished by Springer Nature ,1979
- Some inherently ambiguous context-free languagesInformation and Control, 1971
- Sets recognized by n-tape automataJournal of Algebra, 1969
- Transductions des langages de ChomskyAnnales de l'institut Fourier, 1968
- A machine realization of the linear context-free languagesInformation and Control, 1967
- On Relations Defined by Generalized Finite AutomataIBM Journal of Research and Development, 1965
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959