Theory of ω-languagesI: Characterizations of ω-context-free languages
- 1 October 1977
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 15 (2), 169-184
- https://doi.org/10.1016/s0022-0000(77)80004-4
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Theory of ω-languages. II: A study of various models of ω-type generation and recognitionJournal of Computer and System Sciences, 1977
- Theories of automata on ω-tapes: A simplified approachJournal of Computer and System Sciences, 1974
- Time-restricted sequence generationJournal of Computer and System Sciences, 1970
- Decision problems forω-automataTheory of Computing Systems, 1969
- Definability in the monadic second-order theory of successorThe Journal of Symbolic Logic, 1969
- Sets of Numbers Defined by Finite AutomataThe American Mathematical Monthly, 1967
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966
- Decidability and undecidability of extensions of second (first) order theory of (generalized) successorThe Journal of Symbolic Logic, 1966
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- Decision methods in the theory of ordinalsBulletin of the American Mathematical Society, 1965