Wadge Degrees of Infinitary Rational Relations
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 , there exist some -complete and some -complete infinitary rational relations. And the supremum of the set of Borel ranks of infinitary rational relations is an ordinal which is strictly greater than the first non-recursive ordinal . 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