Time- and tape-bounded turing acceptors and AFLs
- 1 December 1970
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 4 (6), 606-621
- https://doi.org/10.1016/s0022-0000(70)80031-9
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Quasi-realtime languagesTheory of Computing Systems, 1970
- A generator of context-sensitive languagesJournal of Computer and System Sciences, 1969
- Automata-based computational complexityInformation Sciences, 1969
- Toward a Theory of EnumerationsJournal of the ACM, 1969
- Some Results on Tape-Bounded Turing MachinesJournal of the ACM, 1969
- Real-Time Definable LanguagesJournal of the ACM, 1967
- Hierarchies of memory limited computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965
- Memory bounds for recognition of context-free and context-sensitive languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965
- Real-Time Computation and Recursive Functions Not Real-Time ComputableIEEE Transactions on Electronic Computers, 1962