Papers
Topics
Authors
Recent
2000 character limit reached

Wadge Degrees of Infinitary Rational Relations

Published 21 Apr 2008 in cs.LO, cs.CC, and math.LO | (0804.3266v1)

Abstract: We show that, from the topological point of view, 2-tape B\"uchi automata have the same accepting power as Turing machines equipped with a B\"uchi acceptance condition. The Borel and the Wadge hierarchies of the class RAT_omega of infinitary rational relations accepted by 2-tape B\"uchi automata are equal to the Borel and the Wadge hierarchies of omega-languages accepted by real-time B\"uchi 1-counter automata or by B\"uchi Turing machines. In particular, for every non-null recursive ordinal $\alpha$, there exist some $\Sigma0_\alpha$-complete and some $\Pi0_\alpha$-complete infinitary rational relations. And the supremum of the set of Borel ranks of infinitary rational relations is an ordinal $\gamma1_2$ which is strictly greater than the first non-recursive ordinal $\omega_1{CK}$. This very surprising result gives answers to questions of Simonnet (1992) and of Lescow and Thomas (1988,1994).

Citations (10)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.