Finite-Turn Pushdown Automata
Authors:
- Seymour GinsburgSGSeymour Ginsburg
- Edwin H. SpanierESEdwin H. Spanier
- 1 August 1966
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control
- Vol. 4 (3) , 429-453
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- The Unsolvability of the Recognition of Linear Context-Free LanguagesJournal of the ACM, 1966
- Some problems of finite representabilityInformation and Control, 1965
- On Relations Defined by Generalized Finite AutomataIBM Journal of Research and Development, 1965
- Phrase structure languages, finite machines, and channel capacityInformation and Control, 1963
- Operations Which Preserve Definability in LanguagesJournal of the ACM, 1963
- The Algebraic Theory of Context-Free Languages1963
- On certain formal properties of grammarsInformation and Control, 1959
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959