14 citations · 34 across the 16 of their papers we have counts for
19 papers · 1 filter
Linear Recurrence Sequence Automata and the Addition of Abstract Numeration Systems
Olivier Carton, Jean-Michel Couvreur, Martin Delacourt +1
Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Seq…
Deterministic regular functions of infinite words
Olivier Carton, Gaëtan Douéneau-Tabot, Emmanuel Filiot +1
Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead. Equivalently, Alur et. al. have shown that they…
Deterministic pushdown automata can compress some normal sequences
Olivier Carton, Sylvain Perifel
In this paper, we give a deterministic pushdown transducer and a normal sequence of digits compressed by it. This solves positively a question left open in a previous paper by V. B…
Continuous rational functions are deterministic regular
Olivier Carton, Gaëtan Douéneau-Tabot
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer. Over finite words, it is a classical result that any rational function is regul…
Aperiodic two-way transducers and FO-transductions
Olivier Carton, Luc Dartois
Deterministic two-way transducers on finite words have been shown by Engelfriet and Hoogeboom to have the same expressive power as MSO-transductions. We introduce a notion of aperi…
Ambiguity through the lens of measure theory
Olivier Carton
In this paper, we establish a strong link between the ambiguity for finite words of a Büchi automaton and the ambiguity for infinite words of the same automaton. This link is based…