Add to ORKGInternational audienceWe prove in this paper that there exists some infinitary rational relations which are analytic but non Borel sets, giving an answer to a question of Simonnet [Automates et Théorie Descriptive, Ph. D. Thesis, Université Paris 7, March 1992]
The supremum of the set of Borel ranks of omega-context-free languages is actually greater than the ...
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, ...
International audienceWe prove in this paper that there exists some infinitary rational relations wh...
We prove that for every countable ordinal alpha one cannot decide whether a given infinitary rationa...
International audienceWe give in this paper an example of infinitary rational relation, accepted by ...
to appear in the journal Mathematics in Computer Science, in a Special Issue on Intensional Programm...
Final version, published in Logical Methods in Computer Science.International audienceWe prove the f...
International audienceWe consider the set of infinite real traces, over a dependence alphabet (Gamma...
We prove that for every countable ordinal α one cannot decide whether a given infinitary rational re...
To appear in the Proceedings of the 16th EACSL Annual Conference on Computer Science and Logic, CSL ...
International audienceThis is an extended abstract presenting new results on the topological complex...
International audienceWe show that, from a topological point of view, 2-tape Büchi automata have the...
International audienceLocal sentences and the formal languages they define were introduced by Ressay...
to appear in Archive for Mathematical LogicInternational audienceLocally finite omega-languages were...
The supremum of the set of Borel ranks of omega-context-free languages is actually greater than the ...
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, ...
International audienceWe prove in this paper that there exists some infinitary rational relations wh...
We prove that for every countable ordinal alpha one cannot decide whether a given infinitary rationa...
International audienceWe give in this paper an example of infinitary rational relation, accepted by ...
to appear in the journal Mathematics in Computer Science, in a Special Issue on Intensional Programm...
Final version, published in Logical Methods in Computer Science.International audienceWe prove the f...
International audienceWe consider the set of infinite real traces, over a dependence alphabet (Gamma...
We prove that for every countable ordinal α one cannot decide whether a given infinitary rational re...
To appear in the Proceedings of the 16th EACSL Annual Conference on Computer Science and Logic, CSL ...
International audienceThis is an extended abstract presenting new results on the topological complex...
International audienceWe show that, from a topological point of view, 2-tape Büchi automata have the...
International audienceLocal sentences and the formal languages they define were introduced by Ressay...
to appear in Archive for Mathematical LogicInternational audienceLocally finite omega-languages were...
The supremum of the set of Borel ranks of omega-context-free languages is actually greater than the ...
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, ...