Sylvain Lombardy

Orcid: 0000-0003-2738-8175

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Morphisms and Minimisation of Weighted Automata.
Fundam. Informaticae, 2022

The Net Automaton of a Rational Expression.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021
Morphisms and minimization of weighted automata.
CoRR, 2021

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

Max-plus automata.
Proceedings of the Handbook of Automata Theory., 2021

2020
Unambiguous Separators for Tropical Tree Automata.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2019
From Hadamard expressions to weighted rotating automata and back.
Theor. Comput. Sci., 2019

2018
Two Routes to Automata Minimization and the Ways to Reach It Efficiently.
Proceedings of the Implementation and Application of Automata, 2018

On Hadamard Series and Rotating Q-Automata.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Two-Way Automata over Locally Finite Semirings.
Proceedings of the Descriptional Complexity of Formal Systems, 2018

2016
Two-way representations and weighted automata.
RAIRO Theor. Informatics Appl., 2016

2015
Weighted two-way automata.
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.
Int. J. Found. Comput. Sci., 2014

On Determinism and Unambiguity of Weighted Two-way Automata.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

A Type System for Weighted Automata and Rational Expressions.
Proceedings of the Implementation and Application of Automata, 2014

Tropical Two-Way Automata.
Proceedings of the Theoretical Computer Science, 2014

2013
The Validity of Weighted Automata.
Int. J. Algebra Comput., 2013

Implementation Concepts in Vaucanson 2.
Proceedings of the Implementation and Application of Automata, 2013

2012
On the Finiteness Problem for Automaton (Semi)Groups.
Int. J. Algebra Comput., 2012

The Removal of Weighted ε-Transitions.
Proceedings of the Implementation and Application of Automata, 2012

Factor and Subsequence Kernels and Signatures of Rational Languages.
Proceedings of the Implementation and Application of Automata, 2012

Decidability of Geometricity of Regular Languages.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2010
On the Number of Broken Derived Terms of a Rational Expression.
J. Autom. Lang. Comb., 2010

Corrigendum to our paper: How Expressions Can Code for Automata.
RAIRO Theor. Informatics Appl., 2010

Radix Cross-Sections for Length Morphisms.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Regular Temporal Cost Functions.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008
Embeddings of local automata.
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.
Proceedings of the Finite-State Methods and Natural Language Processing, 2008

The universal automaton.
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
CoRR, 2007

On the Size of the Universal Automaton of a Regular Language.
Proceedings of the STACS 2007, 2007

2006
Sequential?
Theor. Comput. Sci., 2006

Series which are both max-plus and min-plus rational are unambiguous.
RAIRO Theor. Informatics Appl., 2006

Conjugacy and Equivalence of Weighted Automata and Functional Transducers.
Proceedings of the Computer Science, 2006

2005
Derivatives of rational expressions with multiplicity.
Theor. Comput. Sci., 2005

How expressions can code for automata.
RAIRO Theor. Informatics Appl., 2005

Inside Vaucanson.
Proceedings of the Implementation and Application of Automata, 2005

On the Equivalence of -Automata.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

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

2004
Introducing VA<sub>UCANSON</sub>.
Theor. Comput. Sci., 2004

Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton.
Theor. Comput. Sci., 2004

2003
Introducing VAUCANSON.
Proceedings of the Implementation and Application of Automata, 2003

Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002
Derivation of Rational Expressions with Multiplicity.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Star Height of Reversible Languages and Universal Automata.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

On the Construction of Reversible Automata for Reversible Languages.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
Approche structurelle de quelques problèmes de la théorie des automates.
PhD thesis, 2001

2000
On the Star Height of Rational Languages: A New Presentation for Two Old Results.
Proceedings of the International Colloquium on Words, 2000


  Loading...