Two-way sequential transductions and stack automata
- 30 June 1971
- journal article
- Published by Elsevier in Information and Control
- Vol. 18 (5) , 404-446
- https://doi.org/10.1016/s0019-9958(71)90483-9
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Indexed Grammars—An Extension of Context-Free GrammarsJournal of the ACM, 1968
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machinesJournal of the ACM, 1968
- One-way stack automataJournal of the ACM, 1967
- Stack automata and compilingJournal of the ACM, 1967
- Decision Problems of Phrase-Structure GrammarsIEEE Transactions on Electronic Computers, 1964
- Classes of languages and linear-bounded automataInformation and Control, 1964
- On certain formal properties of grammarsInformation and Control, 1959
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959
- The Reduction of Two-Way Automata to One-Way AutomataIBM Journal of Research and Development, 1959