1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.FL2021
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…
math.AG2016★ 1 cited
On The Effective Construction of Asymmetric Chudnovsky Multiplication Algorithms in Finite Fields Without Derivated Evaluation
Stéphane Ballet, Nicolas Baudru, Alexis Bonnecaze +1
The Chudnovsky and Chudnovsky algorithm for the multiplication in extensions of finite fields provides a bilinear complexity which is uniformly linear whith respect to the degree o…
cs.CC2005
Polynomial Synthesis of Asynchronous Automata
Nicolas Baudru, Rémi Morin
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes with a distributed control structure called asynchron…