Alternating on-line turing machines with only universal states and small space bounds
- 1 January 1985
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 41, 331-339
- https://doi.org/10.1016/0304-3975(85)90080-5
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Bandwidth constraints on problems complete for polynomial timeTheoretical Computer Science, 1983
- Two-dimensional alternating turing machines with only universal statesInformation and Control, 1982
- A note on alternating on-line Turing machinesInformation Processing Letters, 1982
- An extension of Savitch's theorem to small space boundsInformation Processing Letters, 1981
- AlternationJournal of the ACM, 1981
- Tree-size bounded alternationJournal of Computer and System Sciences, 1980
- On alternationActa Informatica, 1980