论文信息 - Wadge Reducibility and Infinite Computations - 字舞流文

Wadge Reducibility and Infinite Computations

Abstract.This is a survey of results about Wadge reducibility in some spaces and its relation to the study of infinite (non-terminating) computations. We also discuss the related techniques and directions of future research.

Victor L. Selivanov | V. Selivanov

[1] Peter Hertling,et al. Topological Complexity with Continuous Operations , 1996, J. Complex..

[2] Joost Engelfriet,et al. X-Automata on omega-Words , 1993, Theor. Comput. Sci..

[3] William W. Wadge,et al. Lucid - A Formal System for Writing and Proving Programs , 1976, SIAM J. Comput..

[4] Olivier Finkel,et al. Topology and ambiguity in ω-context free languages , 2003 .

[5] Olivier Finkel,et al. There Exist Some omega -Powers of Any Borel Rank , 2007, CSL.

[6] Klaus Weihrauch,et al. Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms , 1994, CCCG.

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

[8] Olivier Finkel,et al. Borel hierarchy and omega context free languages , 2003, Theor. Comput. Sci..

[9] Robert K. Brayton,et al. Structural Complexity of Omega-Automata , 1995, STACS.

[10] Olivier Carton,et al. Chains and Superchains for ω-Rational Sets, Automata and Semigroups , 1997, Int. J. Algebra Comput..

[11] Olivier Finkel,et al. Wadge hierarchy of omega context-free languages , 2001, Theor. Comput. Sci..

[12] Jacques Duparc,et al. The Missing Link for omega-rational Sets, Automata, and Semigroups , 2006, Int. J. Algebra Comput..

[13] Jacques Duparc,et al. A hierarchy of deterministic context-free omega-languages , 2003, Theor. Comput. Sci..