7 papers
Weighted Automata and Expressions over Pre-Rational Monoids
Nicolas Baudru, Louis-Marie Dando, Nathan Lhote +3
The Kleene theorem establishes a fundamental link between automata and expressions over the free monoid. Numerous generalisations of this result exist in the literature. Lifting th…
On Computability of Data Word Functions Defined by Transducers
Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data omega-words). The notion of computability is define…
Sequentiality of String-to-Context Transducers
Pierre-Alain Reynier, Didier Villevalois
Transducers extend finite state automata with outputs, and describe transformations from strings to strings. Sequential transducers, which have a deterministic behaviour regarding…
Symbolic Approximation of Weighted Timed Games
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
Weighted timed games are zero-sum games played by two players on a timed automaton equipped with weights, where one player wants to minimise the accumulated weight while reaching a…
Optimal Reachability in Divergent Weighted Timed Games
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
Weighted timed games are played by two players on a timed automaton equipped with weights: one player wants to minimise the accumulated weight while reaching a target, while the ot…
Two-Way Visibly Pushdown Automata and Transducers
Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier +1
Automata-logic connections are pillars of the theory of regular languages. Such connections are harder to obtain for transducers, but important results have been obtained recently…