Chain automata

Theoretical Computer Science

Volumn 161, Issue 1-2, 1996, Pages 191-203

  Carton, Olivier ^a  

^a Université de Marne la Vallée   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; TOPOLOGY;

ACCEPTANCE CONDITION; AUTOMATON FOR THE UNION; CHAIN AUTOMATA; COMPLEMENT; INTERSECTION; NATURAL REDUCTION; RABIN AUTOMATA; RABIN INDEX;

AUTOMATA THEORY;

EID: 0030181981     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00103-4     Document Type: Article

References (12)

1. O. Carton, Mots infinis, ω-semigroupes et topologie, Thèse, Université Paris VII, 1993.
2. O. Carton, Chain automata, in: Proc. IFIP World Computer Congress '94 (Hamburg, 1994) (Elsevier, Amsterdam, 1994).
3. O. Carton and D. Perrin, Chains and superchains for ω-rational sets, automata and semigroups, Internat. J. Algebra and Comput., to appear.
4. F. Hausdorff, Set Theory (Chelsea, New York, 1957).
5. M. Kaminski, A classification of ω-regular languages, Theoret. Comput. Sci. 36 (1985) 217-229.
6. L.H. Landweber, Decision problems for ω-automata, Math. Systems Theory 3 (1969) 376-384.
7. R McNaughton, Testing and generating infinite sequences by a finite automaton, Inform. and Control 9 (1966) 521-530.
8. D. Muller, Infinite sequences and finite machines, in: Proc. 4th Annual Symp. IEEE. Switching Theory and Logical Design (1963).
9. D. Perrin and J.E. Pin, Infinite Words (Princeton University Press, Princeton, 1993); Version 1.1LITP Report 93.40, to be issued.
10. M.O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969) 1-35.
11. M.O. Rabin, Automata on infinite objects and Church's problem, Amer. Math. Soc. Regional Conf. Series in Math. 13 (1972) 1-23.
12. K. Wagner, On ω-regular sets, inform. and Control 43 (1979) 123-177.