Abstract
It was noticed by Harel in [Har86] that "one can define -complete versions of the well-known Post Correspondence Problem". We first give a complete proof of this result, showing that the infinite Post Correspondence Problem in a regular -language is -complete, hence located beyond the arithmetical hierarchy and highly undecidable. We infer from this result that it is -complete to determine whether two given infinitary rational relations are disjoint. Then we prove that there is an amazing gap between two decision problems about -rational functions realized by finite state Büchi transducers. Indeed Prieur proved in [Pri01, Pri02] that it is decidable whether a given -rational function is continuous, while we show here that it is -complete to determine whether a given -rational function has at least one point of continuity. Next we prove that it is -complete to determine whether the continuity set of a given -rational function is -regular. This gives the exact complexity of two problems which were shown to be undecidable in [CFS08].
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.