Sylvain Lombardy

According to our database, Sylvain Lombardy authored at least 49 papers between 2000 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

Morphisms and Minimisation of Weighted Automata.

Sylvain Lombardy, Jacques Sakarovitch

Fundam. Informaticae, 2022

The Net Automaton of a Rational Expression.

Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

Morphisms and minimization of weighted automata.

Sylvain Lombardy, Jacques Sakarovitch

CoRR, 2021

Derived terms without derivation a shifted perspective on the derived-term automaton.

Sylvain Lombardy, Jacques Sakarovitch

CoRR, 2021

Max-plus automata.

Sylvain Lombardy, Jean Mairesse

Proceedings of the Handbook of Automata Theory., 2021

2020

Unambiguous Separators for Tropical Tree Automata.

Thomas Colcombet, Sylvain Lombardy

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2019

From Hadamard expressions to weighted rotating automata and back.

Louis-Marie Dando, Sylvain Lombardy

Theor. Comput. Sci., 2019

2018

Two Routes to Automata Minimization and the Ways to Reach It Efficiently.

Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the Implementation and Application of Automata, 2018

On Hadamard Series and Rotating Q-Automata.

Louis-Marie Dando, Sylvain Lombardy

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Two-Way Automata over Locally Finite Semirings.

Louis-Marie Dando, Sylvain Lombardy

Proceedings of the Descriptional Complexity of Formal Systems, 2018

2016

Two-way representations and weighted automata.

Sylvain Lombardy

RAIRO Theor. Informatics Appl., 2016

2015

On Determinism and Unambiguity of Weighted Two-Way Automata.

Vincent Carnino, Sylvain Lombardy

Int. J. Found. Comput. Sci., 2015

Weighted two-way automata.

Sylvain Lombardy

Proceedings of the Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31, 2015

2014

Factorizations and Universal Automaton of omega Languages.

Vincent Carnino, Sylvain Lombardy

Int. J. Found. Comput. Sci., 2014

A Type System for Weighted Automata and Rational Expressions.

Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Luca Saiu, Jacques Sakarovitch

Proceedings of the Implementation and Application of Automata, 2014

Tropical Two-Way Automata.

Vincent Carnino, Sylvain Lombardy

Proceedings of the Theoretical Computer Science, 2014

2013

The Validity of Weighted Automata.

Sylvain Lombardy, Jacques Sakarovitch

Int. J. Algebra Comput., 2013

Implementation Concepts in Vaucanson 2.

Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the Implementation and Application of Automata, 2013

2012

On the Finiteness Problem for Automaton (Semi)Groups.

Ali Akhavi, Ines Klimann, Sylvain Lombardy, Jean Mairesse, Matthieu Picantin

Int. J. Algebra Comput., 2012

The Removal of Weighted ε-Transitions.

Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the Implementation and Application of Automata, 2012

Factor and Subsequence Kernels and Signatures of Rational Languages.

Ahmed Amarni, Sylvain Lombardy

Proceedings of the Implementation and Application of Automata, 2012

Decidability of Geometricity of Regular Languages.

Marie-Pierre Béal, Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Sylvain Lombardy

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2010

On the Number of Broken Derived Terms of a Rational Expression.

Pierre-Yves Angrand, Sylvain Lombardy, Jacques Sakarovitch

J. Autom. Lang. Comb., 2010

Corrigendum to our paper: How Expressions Can Code for Automata.

Sylvain Lombardy, Jacques Sakarovitch

RAIRO Theor. Informatics Appl., 2010

Radix Cross-Sections for Length Morphisms.

Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Regular Temporal Cost Functions.

Thomas Colcombet, Denis Kuperberg, Sylvain Lombardy

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata.

Daniel Kirsten, Sylvain Lombardy

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008

Embeddings of local automata.

Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

An XML Format Proposal for the Description of Weighted Automata, Transducers and Regular Expressions.

Akim Demaille, Alexandre Duret-Lutz, Florian Lesaint, Sylvain Lombardy, Jacques Sakarovitch, Florent Terrones

Proceedings of the Finite-State Methods and Natural Language Processing, 2008

The universal automaton.

Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007

Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton

Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur

CoRR, 2007

On the Size of the Universal Automaton of a Regular Language.

Sylvain Lombardy

Proceedings of the STACS 2007, 2007

2006

Sequential?

Sylvain Lombardy, Jacques Sakarovitch

Theor. Comput. Sci., 2006

Series which are both max-plus and min-plus rational are unambiguous.

Sylvain Lombardy, Jean Mairesse

RAIRO Theor. Informatics Appl., 2006

Conjugacy and Equivalence of Weighted Automata and Functional Transducers.

Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the Computer Science, 2006

2005

Derivatives of rational expressions with multiplicity.

Sylvain Lombardy, Jacques Sakarovitch

Theor. Comput. Sci., 2005

How expressions can code for automata.

Sylvain Lombardy, Jacques Sakarovitch

RAIRO Theor. Informatics Appl., 2005

Inside Vaucanson.

Thomas Claveirole, Sylvain Lombardy, Sarah O'Connor, Louis-Noël Pouchet, Jacques Sakarovitch

Proceedings of the Implementation and Application of Automata, 2005

On the Equivalence of -Automata.

Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Contribution aux problèmes de réalisation des langages et séries rationnels.

Sylvain Lombardy

, 2005

2004

Introducing VA_UCANSON.

Sylvain Lombardy, Yann Régis-Gianas, Jacques Sakarovitch

Theor. Comput. Sci., 2004

Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton.

Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur

Theor. Comput. Sci., 2004

2003

Introducing VAUCANSON.

Sylvain Lombardy, Raphael Poss, Yann Régis-Gianas, Jacques Sakarovitch

Proceedings of the Implementation and Application of Automata, 2003

Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton.

Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002

Derivation of Rational Expressions with Multiplicity.

Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Star Height of Reversible Languages and Universal Automata.

Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

On the Construction of Reversible Automata for Reversible Languages.

Sylvain Lombardy

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

Approche structurelle de quelques problèmes de la théorie des automates.

Sylvain Lombardy

PhD thesis, 2001

2000

On the Star Height of Rational Languages: A New Presentation for Two Old Results.

Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the International Colloquium on Words, 2000