Alternating finite automata on ω-words
Open Access
- 1 January 1984
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 32 (3) , 321-330
- https://doi.org/10.1016/0304-3975(84)90049-5
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- AlternationJournal of the ACM, 1981
- On ω-regular setsInformation and Control, 1979
- ω-Computations on Turing machinesTheoretical Computer Science, 1978
- ω-Computations on deterministic pushdown machinesJournal of Computer and System Sciences, 1978
- Theory of ω-languages. II: A study of various models of ω-type generation and recognitionJournal of Computer and System Sciences, 1977
- Theory of ω-languagesI: Characterizations of ω-context-free languagesJournal of Computer and System Sciences, 1977
- Theories of automata on ω-tapes: A simplified approachJournal of Computer and System Sciences, 1974
- Decision problems forω-automataTheory of Computing Systems, 1969
- Sets of Numbers Defined by Finite AutomataThe American Mathematical Monthly, 1967
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966