Add to ORKGInternational audienceWe consider the set of infinite real traces, over a dependence alphabet (Gamma, D) with no isolated letter, equipped with the topology induced by the prefix metric. We then prove that all rational languages of infinite real traces are analytic sets and that there exist some rational languages of infinite real traces which are analytic but non Borel sets, and even Sigma^1_1-complete, hence of maximum possible topological complexity
International audienceWe survey recent results on the topological complexity of context-free omega-l...
We prove that for every countable ordinal alpha one cannot decide whether a given infinitary rationa...
AbstractLanguages with infinite words have often been studied as subsets of a topological space. The...
International audienceWe prove in this paper that there exists some infinitary rational relations wh...
Final version, published in Logical Methods in Computer Science.International audienceWe prove the f...
The supremum of the set of Borel ranks of omega-context-free languages is actually greater than the ...
International audienceWe prove in this paper that there exists some infinitary rational relations wh...
AbstractThe main results of the present paper are the equivalence of definability by monadic second-...
To appear in the Proceedings of the 16th EACSL Annual Conference on Computer Science and Logic, CSL ...
to appear in Archive for Mathematical LogicInternational audienceLocally finite omega-languages were...
International audienceThis is an extended abstract presenting new results on the topological complex...
International audienceLocal sentences and the formal languages they define were introduced by Ressay...
AbstractAs was noted by Mazurkiewicz, traces constitute a convenient tool for describing finite beha...
AbstractThis paper is a continuation of the study of topological properties of omega context free la...
AbstractThe present paper characterizes the topological structure of real traces. This is done in te...
International audienceWe survey recent results on the topological complexity of context-free omega-l...
We prove that for every countable ordinal alpha one cannot decide whether a given infinitary rationa...
AbstractLanguages with infinite words have often been studied as subsets of a topological space. The...
International audienceWe prove in this paper that there exists some infinitary rational relations wh...
Final version, published in Logical Methods in Computer Science.International audienceWe prove the f...
The supremum of the set of Borel ranks of omega-context-free languages is actually greater than the ...
International audienceWe prove in this paper that there exists some infinitary rational relations wh...
AbstractThe main results of the present paper are the equivalence of definability by monadic second-...
To appear in the Proceedings of the 16th EACSL Annual Conference on Computer Science and Logic, CSL ...
to appear in Archive for Mathematical LogicInternational audienceLocally finite omega-languages were...
International audienceThis is an extended abstract presenting new results on the topological complex...
International audienceLocal sentences and the formal languages they define were introduced by Ressay...
AbstractAs was noted by Mazurkiewicz, traces constitute a convenient tool for describing finite beha...
AbstractThis paper is a continuation of the study of topological properties of omega context free la...
AbstractThe present paper characterizes the topological structure of real traces. This is done in te...
International audienceWe survey recent results on the topological complexity of context-free omega-l...
We prove that for every countable ordinal alpha one cannot decide whether a given infinitary rationa...
AbstractLanguages with infinite words have often been studied as subsets of a topological space. The...