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

Journal of Computer and System Sciences

Volumn 15, Issue 2, 1977, Pages 169-184

  Cohen, Rina S ^a   Gold, Arie Y ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000136802     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(77)80004-4     Document Type: Article

References (22)

1. On a Decision Method in Restricted Second Order Arithmetic
2. Dcision methods in the theory of ordinals
3. Definability in the monadic second order theory of successor
4. Finite Automata on Infinite Structures
5. Theories of automata on ω-tapes: A simplified approach
6. Theory of ω-languages. II: A study of various models of ω-type generation and recognition
7. Complexity of ω-Computations on Deterministic Pushdown Machines
8. ω-Computations on Turing Machines
9. “The ω-Kleene Closure of Families of Languages” Abstract 74T-C47
10. Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
11. Time restricted sequence generation
12. Sets of numbers defined by finite automata
13. On the computational complexity of algorithms
14. Finite Tree Automata and ω-automata
15. Decision problems for ω-automata
16. Testing and generating infinite sequences by a finite automaton
17. Infinite Sequences and Finite Machines
18. Decidability of second-order theories and automata on infinite trees