default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSylvain Lombardy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2005
[b2]Sylvain Lombardy:
Contribution aux problèmes de réalisation des langages et séries rationnels. Paris Diderot University, France, 2005- 2001
- [b1]Sylvain Lombardy:
Approche structurelle de quelques problèmes de la théorie des automates. Télécom ParisTech, France, 2001
Journal Articles
- 2022
- [j15]Sylvain Lombardy, Jacques Sakarovitch:
Morphisms and Minimisation of Weighted Automata. Fundam. Informaticae 186(1-4): 195-218 (2022) - 2019
- [j14]Louis-Marie Dando, Sylvain Lombardy:
From Hadamard expressions to weighted rotating automata and back. Theor. Comput. Sci. 787: 28-44 (2019) - 2016
- [j13]Sylvain Lombardy:
Two-way representations and weighted automata. RAIRO Theor. Informatics Appl. 50(4): 331-350 (2016) - 2015
- [j12]Vincent Carnino, Sylvain Lombardy:
On Determinism and Unambiguity of Weighted Two-Way Automata. Int. J. Found. Comput. Sci. 26(8): 1127-1146 (2015) - 2014
- [j11]Vincent Carnino, Sylvain Lombardy:
Factorizations and Universal Automaton of omega Languages. Int. J. Found. Comput. Sci. 25(8): 1111-1126 (2014) - 2013
- [j10]Sylvain Lombardy, Jacques Sakarovitch:
The Validity of Weighted Automata. Int. J. Algebra Comput. 23(4): 863-914 (2013) - 2012
- [j9]Ali Akhavi, Ines Klimann, Sylvain Lombardy, Jean Mairesse, Matthieu Picantin:
On the Finiteness Problem for Automaton (Semi)Groups. Int. J. Algebra Comput. 22(6) (2012) - 2010
- [j8]Sylvain Lombardy, Jacques Sakarovitch:
Corrigendum to our paper: How Expressions Can Code for Automata. RAIRO Theor. Informatics Appl. 44(3): 339-361 (2010) - [j7]Pierre-Yves Angrand, Sylvain Lombardy, Jacques Sakarovitch:
On the Number of Broken Derived Terms of a Rational Expression. J. Autom. Lang. Comb. 15(1/2): 27-51 (2010) - 2006
- [j6]Sylvain Lombardy, Jean Mairesse:
Series which are both max-plus and min-plus rational are unambiguous. RAIRO Theor. Informatics Appl. 40(1): 1-14 (2006) - [j5]Sylvain Lombardy, Jacques Sakarovitch:
Sequential? Theor. Comput. Sci. 356(1-2): 224-244 (2006) - 2005
- [j4]Sylvain Lombardy, Jacques Sakarovitch:
How expressions can code for automata. RAIRO Theor. Informatics Appl. 39(1): 217-237 (2005) - [j3]Sylvain Lombardy, Jacques Sakarovitch:
Derivatives of rational expressions with multiplicity. Theor. Comput. Sci. 332(1-3): 141-177 (2005) - 2004
- [j2]Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur:
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton. Theor. Comput. Sci. 327(3): 349-373 (2004) - [j1]Sylvain Lombardy, Yann Régis-Gianas, Jacques Sakarovitch:
Introducing VAUCANSON. Theor. Comput. Sci. 328(1-2): 77-96 (2004)
Conference and Workshop Papers
- 2022
- [c33]Sylvain Lombardy, Jacques Sakarovitch:
The Net Automaton of a Rational Expression. LATIN 2022: 376-392 - 2020
- [c32]Thomas Colcombet
, Sylvain Lombardy:
Unambiguous Separators for Tropical Tree Automata. STACS 2020: 32:1-32:13 - 2018
- [c31]Louis-Marie Dando, Sylvain Lombardy:
Two-Way Automata over Locally Finite Semirings. DCFS 2018: 62-74 - [c30]Louis-Marie Dando, Sylvain Lombardy:
On Hadamard Series and Rotating Q-Automata. MFCS 2018: 6:1-6:14 - [c29]Sylvain Lombardy, Jacques Sakarovitch:
The Validity of Weighted Automata. CIAA 2018: 41-45 - [c28]Sylvain Lombardy, Jacques Sakarovitch:
Two Routes to Automata Minimization and the Ways to Reach It Efficiently. CIAA 2018: 248-260 - 2017
- [c27]Louis-Marie Dando, Sylvain Lombardy:
From Hadamard Expressions to Weighted Rotating Automata and Back. CIAA 2017: 163-174 - 2015
- [c26]Sylvain Lombardy:
Weighted two-way automata. NCMA 2015: 37-47 - 2014
- [c25]Vincent Carnino, Sylvain Lombardy:
Tropical Two-Way Automata. IFIP TCS 2014: 195-206 - [c24]Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Luca Saiu, Jacques Sakarovitch:
A Type System for Weighted Automata and Rational Expressions. CIAA 2014: 162-175 - [c23]Vincent Carnino, Sylvain Lombardy:
On Determinism and Unambiguity of Weighted Two-way Automata. AFL 2014: 188-200 - 2013
- [c22]Vincent Carnino, Sylvain Lombardy:
Factorizations and Universal Automaton of Omega Languages. Developments in Language Theory 2013: 338-349 - [c21]Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Jacques Sakarovitch:
Implementation Concepts in Vaucanson 2. CIAA 2013: 122-133 - 2012
- [c20]Marie-Pierre Béal, Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Sylvain Lombardy:
Decidability of Geometricity of Regular Languages. Developments in Language Theory 2012: 62-72 - [c19]Ahmed Amarni, Sylvain Lombardy:
Factor and Subsequence Kernels and Signatures of Rational Languages. CIAA 2012: 313-320 - [c18]Sylvain Lombardy, Jacques Sakarovitch:
The Removal of Weighted ε-Transitions. CIAA 2012: 345-352 - 2010
- [c17]Thomas Colcombet, Denis Kuperberg, Sylvain Lombardy:
Regular Temporal Cost Functions. ICALP (2) 2010: 563-574 - [c16]Sylvain Lombardy, Jacques Sakarovitch:
Radix Cross-Sections for Length Morphisms. LATIN 2010: 184-195 - 2009
- [c15]Daniel Kirsten, Sylvain Lombardy:
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata. STACS 2009: 589-600 - 2008
- [c14]Sylvain Lombardy, Jacques Sakarovitch:
The universal automaton. Logic and Automata 2008: 457-504 - [c13]Akim Demaille, Alexandre Duret-Lutz, Florian Lesaint, Sylvain Lombardy, Jacques Sakarovitch, Florent Terrones:
An XML Format Proposal for the Description of Weighted Automata, Transducers and Regular Expressions. FSMNLP 2008: 199-206 - [c12]Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin:
Embeddings of local automata. ISIT 2008: 2351-2355 - 2007
- [c11]Sylvain Lombardy:
On the Size of the Universal Automaton of a Regular Language. STACS 2007: 85-96 - 2006
- [c10]Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch:
Conjugacy and Equivalence of Weighted Automata and Functional Transducers. CSR 2006: 58-69 - 2005
- [c9]Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch:
On the Equivalence of -Automata. ICALP 2005: 397-409 - [c8]Thomas Claveirole, Sylvain Lombardy, Sarah O'Connor, Louis-Noël Pouchet, Jacques Sakarovitch:
Inside Vaucanson. CIAA 2005: 116-128 - 2004
- [c7]Sylvain Lombardy, Jacques Sakarovitch:
How Expressions Can Code for Automata. LATIN 2004: 242-251 - 2003
- [c6]Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur:
Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton. Developments in Language Theory 2003: 373-385 - [c5]Sylvain Lombardy, Raphael Poss, Yann Régis-Gianas, Jacques Sakarovitch:
Introducing VAUCANSON. CIAA 2003: 96-107 - 2002
- [c4]Sylvain Lombardy:
On the Construction of Reversible Automata for Reversible Languages. ICALP 2002: 170-182 - [c3]Sylvain Lombardy, Jacques Sakarovitch:
Star Height of Reversible Languages and Universal Automata. LATIN 2002: 76-90 - [c2]Sylvain Lombardy, Jacques Sakarovitch:
Derivation of Rational Expressions with Multiplicity. MFCS 2002: 471-482 - 2000
- [c1]Sylvain Lombardy, Jacques Sakarovitch:
On the Star Height of Rational Languages: A New Presentation for Two Old Results. Words, Languages & Combinatorics 2000: 266-285
Parts in Books or Collections
- 2021
- [p1]Sylvain Lombardy, Jean Mairesse:
Max-plus automata. Handbook of Automata Theory (I.) 2021: 151-188
Editorship
- 2023
- [e1]Jérôme Leroux, Sylvain Lombardy, David Peleg:
48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France. LIPIcs 272, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-292-1 [contents]
Informal and Other Publications
- 2021
- [i6]Sylvain Lombardy, Jacques Sakarovitch:
Derived terms without derivation a shifted perspective on the derived-term automaton. CoRR abs/2110.09181 (2021) - [i5]Sylvain Lombardy, Jacques Sakarovitch:
Morphisms and minimization of weighted automata. CoRR abs/2112.09387 (2021) - 2019
- [i4]Thomas Colcombet, Sylvain Lombardy:
Unambiguous separators for tropical tree automata. CoRR abs/1910.02164 (2019) - 2011
- [i3]Ali Akhavi, Ines Klimann, Sylvain Lombardy, Jean Mairesse, Matthieu Picantin:
On the Finiteness Problem for Automaton (Semi)groups. CoRR abs/1105.4725 (2011) - 2007
- [i2]Sylvain Lombardy, Jean Mairesse:
Series which are both max-plus and min-plus rational are unambiguous. CoRR abs/0709.3257 (2007) - [i1]Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur:
Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton. CoRR abs/0709.4117 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 20:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
