论文信息 - A hierarchy of deterministic context-free omega-languages

A hierarchy of deterministic context-free omega-languages

Twenty years ago, Klaus. W. Wagner came up with a hierarchy of ?-regular sets that actually bears his name. It turned out to be exactly the Wadge hierarchy of the sets of ?-words recognized by deterministic finite automata. We describe the Wadge hierarchy of context-free ?-languages, which stands as an extension of Wagner's work from automata to pushdown automata.

Jacques Duparc | J. Duparc

[1] Olivier Finkel,et al. Computer science and the fine structure of Borel sets , 2001, Theor. Comput. Sci..

[2] Robert A. Van Wesep,et al. Separation Principles and the Axiom of Determinateness , 1978, J. Symb. Log..

[3] A. Kechris. Classical descriptive set theory , 1987 .

[4] J. R. Büchi,et al. Solving sequential conditions by finite-state strategies , 1969 .

[5] Klaus W. Wagner,et al. On omega-Regular Sets , 1979, Inf. Control..

[6] Alain Louveau,et al. The strength of Borel wadge determinacy , 1988 .

[7] Wolfgang Thomas,et al. Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[8] A. Louveau,et al. Some results in the wadge hierarchy of borel sets , 1983 .

[9] Jacques Duparc,et al. Wadge hierarchy and Veblen hierarchy Part I: Borel sets of finite rank , 2001, Journal of Symbolic Logic.

[10] Y. Moschovakis. Descriptive Set Theory , 1980 .

[11] Rina S. Cohen,et al. Omega-Computations on Deterministic Pushdown Machines , 1978, J. Comput. Syst. Sci..

[12] K. Brown,et al. Graduate Texts in Mathematics , 1982 .

[13] Rina S. Cohen,et al. Theory of omega-Languages. I. Characterizations of omega-Context-Free Languages , 1977, J. Comput. Syst. Sci..

[14] Olivier Finkel,et al. Topological properties of omega context-free languages , 2001, Theor. Comput. Sci..

[15] Seymour Ginsburg,et al. Deterministic Context Free Languages , 1966, Inf. Control..