Theory of ω-languagesI: Characterizations of ω-context-free languages

Buchi, 1960, On a Decision Method in Restricted Second Order Arithmetic Buchi, 1965, Dcision methods in the theory of ordinals, Bull. Amer. Math. Soc., 71, 767, 10.1090/S0002-9904-1965-11384-2 Buchi, 1969, Definability in the monadic second order theory of successor, J. Symbolic Logic, 34, 166, 10.2307/2271090 Choueka, 1970, Finite Automata on Infinite Structures Choueka, 1974, Theories of automata on ω-tapes: A simplified approach, J. Comput. System Sci., 8, 117, 10.1016/S0022-0000(74)80051-6 Cohen, 1977, Theory of ω-languages. II: A study of various models of ω-type generation and recognition, Comput. System Sci., 15, 185, 10.1016/S0022-0000(77)80005-6 Cohen, 1975, Complexity of ω-Computations on Deterministic Pushdown Machines Cohen, 1976, ω-Computations on Turing Machines Cohen, 1974, “The ω-Kleene Closure of Families of Languages” Abstract 74T-C47, Notices Amer. Math. Soc., 21, 7 Elgot, 1966, Decidability and undecidability of extensions of second (first) order theory of (generalized) successor, J. Symbolic Logic, 31, 169, 10.2307/2269808 Eilenberg, 1974, Vol. A Fischer, 1970, Time restricted sequence generation, J. Comput. System Sci., 4, 50, 10.1016/S0022-0000(70)80012-5 Ginsburg, 1966 Hopcroft, 1969 Hartmanis, 1967, Sets of numbers defined by finite automata, Amer. Math. Monthly, 74, 539, 10.2307/2314883 Hartmanis, 1965, On the computational complexity of algorithms, Trans. Amer. Math. Soc., 117, 275, 10.1090/S0002-9947-1965-0170805-7 Hosseley, 1972, Finite Tree Automata and ω-automata Landweber, 1969, Decision problems for ω-automata, Math. Systems Theory, 3, 376, 10.1007/BF01691063 McNaughton, 1966, Testing and generating infinite sequences by a finite automaton, Inform. Contr., 9, 521, 10.1016/S0019-9958(66)80013-X Muller, 1963, Infinite Sequences and Finite Machines, 3 Trakhtenbrot, 1973 Rabin, 1969, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc., 141, 1