( en | de | ru )

 

Disambiguation of "Lombardy, Sylvain"

Author of the publication

copydeleteadd this publication to your clipboard
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata.

, and . STACS, volume 3 of LIPIcs, page 589-600. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sylvain Broyer

Sylvain Mogliacci

Sylvain Castagnos

Sylvain Marlière

Sylvain Jay

 

Other publications of authors with the same name

Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata., and . STACS, volume 3 of LIPIcs, page 589-600. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)Factor and Subsequence Kernels and Signatures of Rational Languages., and . CIAA, volume 7381 of Lecture Notes in Computer Science, page 313-320. Springer, (2012)From Hadamard expressions to weighted rotating automata and back., and . Theor. Comput. Sci., (2019)The Removal of Weighted ε-Transitions., and . CIAA, volume 7381 of Lecture Notes in Computer Science, page 345-352. Springer, (2012)On Hadamard Series and Rotating Q-Automata., and . MFCS, volume 117 of LIPIcs, page 6:1-6:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Type System for Weighted Automata and Rational Expressions., , , , and . CIAA, volume 8587 of Lecture Notes in Computer Science, page 162-175. Springer, (2014)The Validity of Weighted Automata., and . CIAA, volume 10977 of Lecture Notes in Computer Science, page 41-45. Springer, (2018)On the Size of the Universal Automaton of a Regular Language.. STACS, volume 4393 of Lecture Notes in Computer Science, page 85-96. Springer, (2007)Approche structurelle de quelques problèmes de la théorie des automates.. Télécom ParisTech, France, (2001)How Expressions Can Code for Automata., and . LATIN, volume 2976 of Lecture Notes in Computer Science, page 242-251. Springer, (2004)