The Complexity of Two-Way Pushdown Automata and Recursive Programs
- 1 January 1985
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Tabulation Techniques for Recursive ProgramsACM Computing Surveys, 1980
- Tree-size bounded alternationJournal of Computer and System Sciences, 1980
- Path Systems: Constructions, Solutions and ApplicationsSIAM Journal on Computing, 1980
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languagesTheory of Computing Systems, 1976
- Two fast simulations which imply some fast string matching and palindrome-recognition algorithmsInformation Processing Letters, 1976
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Multi-tape and multi-head pushdown automataInformation and Control, 1968
- Time and tape complexity of pushdown automaton languagesInformation and Control, 1968
- Two-way pushdown automataInformation and Control, 1967