Computer Science – Computational Complexity
Scientific paper
2008-01-25
Theoretical Informatics and Applications (1), 42 (2008) 183-196
Computer Science
Computational Complexity
Dedicated to Serge Grigorieff on the occasion of his 60th Birthday
Scientific paper
In this paper, we study the continuity of rational functions realized by B\"uchi finite state transducers. It has been shown by Prieur that it can be decided whether such a function is continuous. We prove here that surprisingly, it cannot be decided whether such a function F has at least one point of continuity and that its continuity set C(F) cannot be computed. In the case of a synchronous rational function, we show that its continuity set is rational and that it can be computed. Furthermore we prove that any rational Pi^0_2-subset of X^omega for some alphabet X is the continuity set C(F) of an omega-rational synchronous function F defined on X^omega.
Carton Olivier
Finkel Olivier
Simonnet Pierre
No associations
LandOfFree
On the Continuity Set of an omega Rational Function does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Continuity Set of an omega Rational Function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Continuity Set of an omega Rational Function will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-412372