Wadge Degrees of omega-Languages of Deterministic Turing Machines

Authors:
Victor L. Selivanov
Affiliations:
-
Venue:
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2003

Citing 6
Cited 1

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
Fine hierarchies and Boolean terms

Journal of Symbolic Logic
&ohgr;-languages

Handbook of formal languages, vol. 3
Fine hierarchy of regular &ohgr;-languages

Theoretical Computer Science
Fine Hierarchy of Regular omega-Languages

TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Fundamental study: a hierarchy of deterministic context-free ω-languages

Theoretical Computer Science

On the length of the Wadge hierarchy of ω-context-free languages

Journal of Automata, Languages and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

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 驴 = 驴1CK is the first non-recursive ordinal known as the Church-Kleene ordinal. This answers a question raised in [Du0?].