Advertisement
Published in:
2006 | OriginalPaper | Chapter
On the Accepting Power of 2-Tape Büchi Automata
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We show that, from a topological point of view, 2-tape Büchi automata have the same accepting power than Turing machines equipped with a Büchi acceptance condition. In particular, for every non null recursive ordinal
α
, there exist some Σ
$^{\rm 0}_{\alpha}$
-complete and some Π
$^{\rm 0}_{\alpha}$
-complete infinitary rational relations accepted by 2-tape Büchi automata. This surprising result gives answers to questions of Simonnet [Sim92] and of Lescow and Thomas [Tho90, LT94].