10 citations · 57 across the 48 of their papers we have counts for
4 papers · 1 filter
Highly Undecidable Problems about Recognizability by Tiling Systems
Olivier Finkel
Altenbernd, Thomas and Wöhrle have considered acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with usual acceptance conditio…
On the Continuity Set of an omega Rational Function
Olivier Carton, Olivier Finkel, Pierre Simonnet
In 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…
An omega-power of a context-free language which is Borel above Delta^0_omega
Jacques Duparc, Olivier Finkel
We use erasers-like basic operations on words to construct a set that is both Borel and above Delta^0_omega, built as a set V^ωwhere V is a language of finite words accepted by a p…
On the Accepting Power of 2-Tape Büchi Automata
Olivier Finkel
We show that, from a topological point of view, 2-tape Büchi automata have the same accepting power than Turing machines equipped with a Büchi acceptance condition. In particular,…