4 citations · 6 across the 7 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2019★ 1 cited
Equivalence kernels of sequential functions and sequential observation synthesis
Paulin Fournier, Nathan Lhote
We show that one can decide if a rational equivalence relation can be given as the equivalence kernel of a sequential letter-to-letter transduction. This problem comes from the set…
cs.FL2017★ 1 cited
On Reversible Transducers
Luc Dartois, Paulin Fournier, Ismaël Jecker +1
Deterministic two-way transducers define the robust class of regular functions which is, among other good properties, closed under composition. However, the best known algorithms f…