منابع مشابه
Wadge Degrees of Infinitary Rational Relations
We show that, from the topological point of view, 2-tape Büchi automata have the same accepting power as Turing machines equipped with a Büchi acceptance condition. The Borel and the Wadge hierarchies of the class RATω of infinitary rational relations accepted by 2-tape Büchi automata are equal to the Borel and the Wadge hierarchies of ω-languages accepted by realtime Büchi 1-counter automata o...
متن کاملWadge Degrees of $\omega$-Languages of Petri Nets
We prove that ω-languages of (non-deterministic) Petri nets and ω-languages of (non-deterministic) Turing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Petri nets are equal to the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Turing machines which also form the class of effective...
متن کاملBorel ranks and Wadge degrees of context free ω-languages
We determine completely the Borel hierarchy of the class of context free ω-languages, showing that, for each recursive non null ordinal α, there exist some Σα-complete and some Π 0 α-complete ω-languages accepted by Büchi 1-counter automata.
متن کاملBorel Ranks and Wadge Degrees of Context Free omega-Languages
We show that the Borel hierarchy of the class of context free ω-languages, or even of the class of ω-languages accepted by Büchi 1-counter automata, is the same as the Borel hierarchy of the class of ω-languages accepted by Turing machines with a Büchi acceptance condition. In particular, for each recursive non null ordinal α, there exist some Σ α -complete and some Π α -complete ω-languages ac...
متن کاملOn the Structure of the Wadge Degrees of Bqo-valued Borel Functions
In this article, we give a full description of the Wadge degrees of Borel functions from ω to a better quasi ordering Q. More precisely, for any countable ordinal ξ, we show that the Wadge degrees of ∆1+ξ-measurable functions ω ω → Q can be represented by countable joins of the ξ-th transfinite nests ofQ-labeled well-founded trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1996
ISSN: 0168-0072
DOI: 10.1016/0168-0072(95)00011-9