Dedicated to Serge Grigorieff on the occasion of his 60th BirthdayInternational audienceIn this paper, we study the continuity of rational functions realized by Büchi 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
International audienceWe prove that ω-regular languages accepted by Büchi or Muller automata satisfy...
This paper is a study of topological properties of omega context free languages (omega-CFL). We firs...
International audienceA word-to-word function is continuous for a class of languages V if its invers...
Dedicated to Serge Grigorieff on the occasion of his 60th BirthdayInternational audienceIn this pape...
Dedicated to Serge Grigorieff on the occasion of his 60th BirthdayInternational audienceIn this pape...
AbstractThis paper presents a construction that computes the topological closure of a rational relat...
To appear in: Special Issue: Frontier Between Decidability and Undecidability and Related Problems, ...
The subject of this thesis is the study of the topological complexity of omega-rationals functions :...
A word-to-word function is continuous for a class of languages V if its inverse maps V languages to ...
International audienceA word-to-word function is continuous for a class of languages V if its invers...
We prove that $\omega$-regular languages accepted by B\"uchi or Muller automata satisfy an effec...
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer....
Regular functions from infinite words to infinite words can be equivalentlyspecified by MSO-transduc...
Regular functions from infinite words to infinite words can be equivalently specified by MSO-transdu...
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer....
International audienceWe prove that ω-regular languages accepted by Büchi or Muller automata satisfy...
This paper is a study of topological properties of omega context free languages (omega-CFL). We firs...
International audienceA word-to-word function is continuous for a class of languages V if its invers...
Dedicated to Serge Grigorieff on the occasion of his 60th BirthdayInternational audienceIn this pape...
Dedicated to Serge Grigorieff on the occasion of his 60th BirthdayInternational audienceIn this pape...
AbstractThis paper presents a construction that computes the topological closure of a rational relat...
To appear in: Special Issue: Frontier Between Decidability and Undecidability and Related Problems, ...
The subject of this thesis is the study of the topological complexity of omega-rationals functions :...
A word-to-word function is continuous for a class of languages V if its inverse maps V languages to ...
International audienceA word-to-word function is continuous for a class of languages V if its invers...
We prove that $\omega$-regular languages accepted by B\"uchi or Muller automata satisfy an effec...
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer....
Regular functions from infinite words to infinite words can be equivalentlyspecified by MSO-transduc...
Regular functions from infinite words to infinite words can be equivalently specified by MSO-transdu...
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer....
International audienceWe prove that ω-regular languages accepted by Büchi or Muller automata satisfy...
This paper is a study of topological properties of omega context free languages (omega-CFL). We firs...
International audienceA word-to-word function is continuous for a class of languages V if its invers...