English

Wadge Degrees of Infinitary Rational Relations

Logic in Computer Science 2009-01-04 v1 Computational Complexity Logic

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 Σα0\Sigma^0_\alpha-complete and some Πα0\Pi^0_\alpha-complete infinitary rational relations. And the supremum of the set of Borel ranks of infinitary rational relations is an ordinal γ21\gamma^1_2 which is strictly greater than the first non-recursive ordinal ω1CK\omega_1^{CK}. This very surprising result gives answers to questions of Simonnet (1992) and of Lescow and Thomas (1988,1994).

Cite

@article{arxiv.0804.3266,
  title  = {Wadge Degrees of Infinitary Rational Relations},
  author = {Olivier Finkel},
  journal= {arXiv preprint arXiv:0804.3266},
  year   = {2009}
}

Comments

to appear in the journal Mathematics in Computer Science, in a Special Issue on Intensional Programming & Semantics, in honour of Bill Wadge on the occasion of his 60th cycle

R2 v1 2026-06-21T10:33:01.852Z