10 citations · 57 across the 48 of their papers we have counts for
12 papers · 1 filter
Some complete -powers of a one-counter language, for any Borel class of finite rank
Olivier Finkel, Dominique Lecomte
We prove that, for any natural number n 1, we can find a finite alphabet and a finitary language L over accepted by a one-counter automaton, such that the -power L…
An Effective Property of -Rational Functions
Olivier Finkel
We prove that -regular languages accepted by Büchi or Muller automata satisfy an effective automata-theoretic version of the Baire property. Then we use this result to obtain a…
Polishness of some topologies related to word or tree automata
Olivier Finkel, Olivier Carton, Dominique Lecomte
We prove that the Büchi topology and the automatic topology are Polish. We also show that this cannot be fully extended to the case of a space of infinite labelled binary trees; in…
Automatic Ordinals
Olivier Finkel, Stevo Todorcevic
We prove that the injectively omega-tree-automatic ordinals are the ordinals smaller than . Then we show that the injectively -automatic ordinals, where is an i…
A Hierarchy of Tree-Automatic Structures
Olivier Finkel, Stevo Todorcevic
We consider -automatic structures which are relational structures whose domain and relations are accepted by automata reading ordinal words of length for some integer $n…
Decision Problems for Recognizable Languages of Infinite Pictures
Olivier Finkel
Altenbernd, Thomas and Wöhrle have considered in [ATW02] acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with the usual acce…