15 citations · 79 across the 28 of their papers we have counts for
5 papers · 1 filter
Two-way Parikh Automata
Emmanuel Filiot, Shibashis Guha, Nicolas Mazzocchi
Parikh automata extend automata with counters whose values can only be tested at the end of the computation, with respect to membership into a semi-linear set. Parikh automata have…
Synthesis of Computable Regular Functions of Infinite Words
V. Dave, E. Filiot, S. Krishna +1
Regular functions from infinite words to infinite words can be equivalently specified by MSO-transducers, streaming -string transducers as well as deterministic two-way transduc…
The Complexity of Transducer Synthesis from Multi-Sequential Specifications
Léo Exibard, Emmanuel Filiot, Ismaël Jecker
The transducer synthesis problem on finite words asks, given a specification , where and are sets of finite words, whether there exists an implement…
Synthesis of Data Word Transducers
Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
In reactive synthesis, the goal is to automatically generate an implementation from a specification of the reactive and non-terminating input/output behaviours of a system. Specifi…
Monadic Second-Order Logic with Path-Measure Quantifier is Undecidable
Raphaël Berthon, Emmanuel Filiot, Shibashis Guha +5
We prove that the theory of Monadic Second-Order logic (MSO) of the infinite binary tree extended with qualitative path-measure quantifier is undecidable. This quantifier says that…