A hierarchy of deterministic context-free ω-languages

Theoretical Computer Science

Volumn 290, Issue 3, 2003, Pages 1253-1300

  Duparc, J ^a  

^a UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

Deterministic context free languages; Pushdown automata; Wadge hierarchy

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE;

CONTEXT-FREE; DETERMINISTIC FINITE AUTOMATA; NOCV1; PUSH-DOWN AUTOMATA; REGULAR SETS; WADGE HIERARCHY;

CONTEXT FREE LANGUAGES;

EID: 85009219505     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00567-4     Document Type: Article

References (20)

1. 1, Decidable Theories II. Lecture Notes in Mathematics, Vol. 328, 1977, Springer, Berlin.
2. [2] Büchi, J.R., Landweber, L.H., Solving sequential conditions by finite-state strategy. Trans. Amer. Math. Soc. 138 (1969), 295–311.
3. [3] Cohen, R.S., Gold, A.Y., Theory of ω-languages. I. Characterizations of ω-context-free languages. J. Comput. System Sci. 15:2 (1977), 169–184.
4. [4] Cohen, R.S., Gold, A.Y., ω-computations on deterministic pushdown machines. J. Comput. System Sci. 16:3 (1978), 275–300.
5. [5] J. Duparc, La forme normale des Boréliens de rangs finis, Thèse de Doctorat, Université Denis Diderot Paris VII, Juillet, 1995.
6. [6] Duparc, J., Wadge hierarchy and Veblen hierarchy: part I Borel sets of finite rank. J. Symbolic Logic 66:1 (2001), 56–86.
7. [7] Duparc, J., Finkel, O., Ressayre, J.-P., Computer science and the fine structure of borel sets. Theoret. Comput. Sci. 257:1–2 (2001), 85–105.
8. [8] Finkel, O., Topological properties of context free ω-languages. Theoret. Comput. Sci. 262:1–2 (2001), 669–697.
9. [9] Ginsburg, S., Greibach, S.A., Deterministic context free languages. Inform. Control 9 (1966), 620–648.
10. [10] Kechris, A.S., Classical Descriptive Set Theory. Graduate Texts in Mathematics, Vol. 156, 1994, Springer, Berlin.
11. [11] A. Louveau, Some Results in the Wadge Hierarchy of Borel Sets, Cabal Sem 79–81, Lecture Notes in Mathematics, Vol. 1019, Springer, Berlin, 1983, pp. 28–55.
12. [12] A. Louveau, J. St.Raymond, The Strength of Borel Wadge Determinacy, Cabal Sem 81–85, Lecture Notes in Mathematics, Vol. 1333, Springer, Berlin, 1985, pp. 1–30.
13. [13] Martin, D.A., Borel determinacy. Ann. Math. 102 (1975), 363–371.
14. [14] Moschovakis, Y.N., Descriptive Set Theory, 1980, North-Holland, Amsterdam.
15. [15] L. Staiger, ω-Languages, Handbook of formal languages, Vol. 3, Springer, Berlin, 1997, pp. 339–387.
16. [16] W. Thomas, Automata on infinite objects, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, chap. 4, Elsevier, Amsterdam, 1990.
17. [17] W.W. Wadge, Degrees of complexity of subsets of the Baire space, Notice Amer. Math. Soc. (1972) A-714.
18. [18] W.W. Wadge, Ph.D. Thesis, Berkeley, 1984.
19. [19] Wagner, K.W., On ω-regular sets. Inform. Control 43:2 (1979), 123–177.
20. [20] Van Wesep, R., Separation principles and the axiom of determinateness. J. Symbolic Logic 43 (1978), 77–81.