Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages
- 1 December 1976
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 10 (1) , 211-228
- https://doi.org/10.1007/bf01683273
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- On tape-bounded complexity classes and multihead finite automataJournal of Computer and System Sciences, 1975
- On two-way multihead automataJournal of Computer and System Sciences, 1973
- An observation on time-storage trade offPublished by Association for Computing Machinery (ACM) ,1973
- On Languages Accepted in Polynomial TimeSIAM Journal on Computing, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Time and tape complexity of pushdown automaton languagesInformation and Control, 1968
- Two-way pushdown automataInformation and Control, 1967