On the complexity of ω-type Turing acceptors
- 31 December 1980
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 10 (3) , 249-272
- https://doi.org/10.1016/0304-3975(80)90049-3
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- ω-Computations on Turing machinesTheoretical Computer Science, 1978
- ω-Computations on deterministic pushdown machinesJournal of Computer and System Sciences, 1978
- Theory of ω-languagesI: Characterizations of ω-context-free languagesJournal of Computer and System Sciences, 1977
- On ω-sets associated with context-free languagesInformation and Control, 1976
- Theories of automata on ω-tapes: A simplified approachJournal of Computer and System Sciences, 1974
- Decision problems forω-automataTheory of Computing Systems, 1969
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966
- Infinite sequences and finite machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1963