Some observations concerning alternating turing machines using small space
- 20 April 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 25 (1) , 1-9
- https://doi.org/10.1016/0020-0190(87)90085-8
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Alternating on-line turing machines with only universal states and small space boundsTheoretical Computer Science, 1985
- AlternationJournal of the ACM, 1981
- Halting space-bounded computationsTheoretical Computer Science, 1980
- On tape bounds for single letter alphabet language processingTheoretical Computer Science, 1976
- A language over a one symbol alphabet requiring only O (log log n) spaceACM SIGACT News, 1975
- Space bounds for processing contentless inputsJournal of Computer and System Sciences, 1975
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Some Results on Tape-Bounded Turing MachinesJournal of the ACM, 1969