Abstract
We describe Wadge degrees of ù-languages recognizable by deterministic Turing machines. In particular, it is shown that the ordinal corresponding to these degrees is ξω where ξ = ωCK 1is the first non-recursive ordinal known as the Church-Kleene ordinal. This answers a question raised in [Du0?].
Keywords
Partly supported by the Russian Foundation for Basic Research Grant 00-01-00810.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Andretta. Notes on Descriptive Set Theory. Manuscript, 2001.
J. Duparc. A hierarchy of deterministic context-free ω-languages. Theor. Comp. Sci., to appear.
Yu. L. Ershov, On a hierarchy of sets II, Algebra and Logic, 7, No 4 (1968), 15–47 (Russian).
J. Köbler, U. Shöning and K.W. Wagner. The difference and truth-table hierarchies for NP. Dep. of Informatics, Koblenz. Preprint 7 (1986).
K. Kuratowski and A. Mostowski. Set Theory. North Holland, Amsterdam, 1967.
A. Louveau. Some results in the Wadge hierarchy of Borel sets, Lecture Notes in Math., 1019 (1983), 28–55.
Y.N. Moschovakis. Descriptive set theory, North Holland, Amsterdam, 1980.
H. Rogers jr. Theory of recursive functions and effective computability. McGraw-Hill, New York, 1967.
V.L. Selivanov. Hierarchies of hyperarithmetical sets and functions. Algebra i Logika, 22, No 6 (1983), 666–692 (English translation: Algebra and Logic, 22 (1983), 473–491).
V.L. Selivanov. Hierarchies, Numerations, Index Sets. Handritten notes, 1992, 300 pp.
V.L. Selivanov. Fine hierarchy of regular ω-languages. Preprint N 14, 1994, the University of Heidelberg, Chair of Mathematical Logic, 13 pp.
V.L. Selivanov. Fine hierarchy of regular ω-languages. Lecture Notes in Comp. Sci., v. 915. Berlin: Springer, 1995, 277–287.
V.L. Selivanov. Fine hierarchies and Boolean terms. J. Symbol. Logic, 60 (1995), 289–317.
V.L. Selivanov. Fine hierarchy of regular ω-languages. Theor. Comp. Sci. 191 (1998), 37–59.
L. Staiger. ω-languages. In: Handbook of Formal Languages v. 3, Springer, Berlin, 1997, 339–387.
J. Steel. Determinateness and the separation property. J. Symbol. Logic, 45 (1980), 143–146.
W. Wadge. Degrees of complexity of subsets of the Baire space. Notices A.M.S. (1972), R–714.
W. Wadge. Reducibility and determinateness in the Baire space. PhD thesis, University of California, Berkeley, 1984.
K. Wagner. On ω-regular sets. Inform. and Control, 43 (1979), 123–177.
Van Wesep. Wadge degrees and descriptive set theory. Lecture Notes in Math., 689 (1978), 151–170.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Selivanov, V. (2003). Wadge Degrees of ω-Languages of Deterministic Turing Machines. In: Alt, H., Habib, M. (eds) STACS 2003. STACS 2003. Lecture Notes in Computer Science, vol 2607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36494-3_10
Download citation
DOI: https://doi.org/10.1007/3-540-36494-3_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00623-7
Online ISBN: 978-3-540-36494-8
eBook Packages: Springer Book Archive