Time and tape bounded auxiliary pushdown automata
- 1 January 1977
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- New problems complete for nondeterministic log spaceTheory of Computing Systems, 1976
- A Note on Tape-Bounded Complexity Classes and Linear Context-Free languagesJournal of the ACM, 1975
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- On tape-bounded complexity classes and multihead finite automataJournal of Computer and System Sciences, 1975
- An observation on time-storage trade offJournal of Computer and System Sciences, 1974
- On vector languagesJournal of Computer and System Sciences, 1974
- The Hardest Context-Free LanguageSIAM Journal on Computing, 1973
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- An hierarchy between context-free and context-sensitive languagesJournal of Computer and System Sciences, 1970
- Memory bounds for recognition of context-free and context-sensitive languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965