Number of documents

51

Publications de Sylvain Lombardy


Journal articles15 documents

  • Louis-Marie Dando, Sylvain Lombardy. From Hadamard expressions to weighted rotating automata and back. Theoretical Computer Science, Elsevier, 2019, 787, pp.28-44. ⟨10.1016/j.tcs.2018.09.017⟩. ⟨hal-02290010⟩
  • Sylvain Lombardy. Two-way representations and weighted automata. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2016, 7th Non-Classical Models of Automata and Applications (NCMA-2015), 50 (4), pp.331-350. ⟨10.1051/ita/2016026⟩. ⟨hal-01484284⟩
  • Vincent Carnino, Sylvain Lombardy. On Determinism and Unambiguity of Weighted Two-Way Automata. International Journal of Foundations of Computer Science, World Scientific Publishing, 2015, Special Issue – Automata and Formal Languages (AFL 2014), 26 (8), pp.1127-1146. ⟨10.1142/S0129054115400158⟩. ⟨hal-01326283⟩
  • Vincent Carnino, Sylvain Lombardy. Factorizations and universal automaton of omega languages. International Journal of Foundations of Computer Science, World Scientific Publishing, 2014, Special Issue – Developments in Language Theory (DLT 2013), 25 (8), pp.1111-1125. ⟨10.1142/S0129054114400279⟩. ⟨hal-01120568⟩
  • Sylvain Lombardy, Jacques Sakarovitch. The validity of weighted automata. International Journal of Algebra and Computation, World Scientific Publishing, 2013, 23, pp.863-913. ⟨10.1142/S0218196713400146⟩. ⟨hal-00845820⟩
  • Ali Akhavi, Ines Klimann, Sylvain Lombardy, Jean Mairesse, Matthieu Picantin. On the finiteness problem for automaton (semi)groups. International Journal of Algebra and Computation, World Scientific Publishing, 2012, 22 (06), pp.1250052.1-1250052.26. ⟨10.1142/S021819671250052X⟩. ⟨hal-00695445⟩
  • Pierre-Yves Angrand, Sylvain Lombardy, Jacques Sakarovitch. On the Number of Broken Derived Terms of a Rational Expression. Journal of Automata Languages and Combinatorics, Otto-von-Guericke-Universität Magdeburg, 2012, 15 (1/2), pp.27-51. ⟨hal-00860155⟩
  • Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin. Embeddings of local automata. Illinois Journal of Mathematics, 2010, 54 (1), pp.155-174. ⟨hal-00619770⟩
  • Sylvain Lombardy, Jacques Sakarovitch. Corrigendum to our paper : How Expressions can code for Automata. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2010, 44 (3), pp.339--361. ⟨10.1051/ita/2010019⟩. ⟨hal-00692898⟩
  • Sylvain Lombardy, Jean Mairesse. Series which are both max-plus and min-plus rational are unambiguous. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2006, 40, pp.1-14. ⟨10.1051/ita:2005042⟩. ⟨hal-00017220⟩
  • Sylvain Lombardy, Jacques Sakarovitch. Sequential ?. Theoretical Computer Science, Elsevier, 2006, 356, pp.224 -- 244. ⟨10.1016/j.tcs.2006.01.028⟩. ⟨hal-00069863⟩
  • Sylvain Lombardy, Jacques Sakarovitch. How expressions can code for automata. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2005, 39, pp.217-237. ⟨10.1051/ita:2005013⟩. ⟨hal-00016385⟩
  • Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur. Deciding Unambiguity and Sequentiality from a Finitely Ambiguous Max-Plus Automaton. Theoretical Computer Science, Elsevier, 2004, 327 (3), pp.349-373. ⟨10.1016/j.tcs.2004.02.049⟩. ⟨hal-00174171⟩
  • Sylvain Lombardy, Jacques Sakarovitch. Derivatives of rational expressions with multiplicity. Theoretical Computer Science, Elsevier, 2004, 332, pp.141-177. ⟨10.1016/j.tcs.2004.10.016⟩. ⟨hal-00017202⟩
  • Sylvain Lombardy, Yann Regis-Gianas, Jacques Sakarovitch. Introducing Vaucanson. Theoretical Computer Science, Elsevier, 2004, 328, pp.77-96. ⟨10.1016/j.tcs.2004.07.007⟩. ⟨hal-00017540⟩

Conference papers31 documents

  • Sylvain Lombardy, Jacques Sakarovitch. Two Routes to Automata Minimization and the Ways to Reach It Efficiently. International Conference on Implementation and Application of Automata, CIAA 2018, Jul 2018, Charlottetown, Canada. pp.248-260, ⟨10.1007/978-3-319-94812-6_21⟩. ⟨hal-01866176⟩
  • Louis-Marie Dando, Sylvain Lombardy. Two-Way Automata over Locally Finite Semirings. 20th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2018, Hallifax, NS, Canada. pp.62-74, ⟨10.1007/978-3-319-94631-3_6⟩. ⟨hal-01866160⟩
  • Louis-Marie Dando, Sylvain Lombardy. On Hadamard Series and Rotating Q-Automata. Mathematical Foundations of Computer Science, MFCS 2018, Igor Potapov; Paul Spirakis; James Worrell, Aug 2018, Liverpool, United Kingdom. pp.6:1--6:14, ⟨10.4230/LIPIcs.MFCS.2018.6⟩. ⟨hal-01866198⟩
  • Louis-Marie Dando, Sylvain Lombardy. From Hadamard Expressions to Weighted Rotating Automata and Back. 22nd International Conference Implementation and Application of Automata, CIAA 2017, Jun 2017, Marne-la-Vallée, France. pp.163-174, ⟨10.1007/978-3-319-60134-2_14⟩. ⟨hal-01544105⟩
  • Vincent Carnino, Sylvain Lombardy. On Determinism and Unambiguity of Weighted Two-way Automata. 14th International Conference on Automata and Formal Languages, May 2014, Szeged, Hungary. pp.188-200, ⟨10.4204/EPTCS.151.13⟩. ⟨hal-01008785⟩
  • Vincent Carnino, Sylvain Lombardy. Tropical Two-Way Automata. 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.195-206, ⟨10.1007/978-3-662-44602-7_16⟩. ⟨hal-01069637⟩
  • Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Luca Saiu, Jacques Sakarovitch. A Type System for Weighted Automata and Rational Expressions. Implementation and Application of Automata, CIAA 2014, Jul 2014, Giessen, Germany. pp.162--175, ⟨10.1007/978-3-319-08846-4_12⟩. ⟨hal-01069654⟩
  • Vincent Carnino, Sylvain Lombardy. Factorizations and Universal Automaton of Omega Languages. Developments in Language Theory - 17th International Conference (DLT'13), 2013, Marne-la-Vallée, France. pp.338-349, ⟨10.1007/978-3-642-38771-5_30⟩. ⟨hal-00841873⟩
  • Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Jacques Sakarovitch. Implementation Concepts in Vaucanson 2. Implementation and Application of Automata, CIAA 2013, Jul 2013, Halifax, Canada. pp.122-133, ⟨10.1007/978-3-642-39274-0_12⟩. ⟨hal-00845816⟩
  • Sylvain Lombardy, Ahmed Amarni. Factor and Subsequence Kernels and Signatures of Rational Languages. 17th International Conference, CIAA 2012, 2012, Porto, Portugal. pp.313-320, ⟨10.1007/978-3-642-31606-7_27⟩. ⟨hal-00737676⟩
  • Sylvain Lombardy, Jacques Sakarovitch. The Removal of Weighted ε-Transitions. 17th International Conference, CIAA 2012, 2012, Porto, Portugal. pp.345-352, ⟨10.1007/978-3-642-31606-7_31⟩. ⟨hal-00737679⟩
  • Marie-Pierre Béal, Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Sylvain Lombardy. Decidability of Geometricity of Regular Languages. 16th International Conference, DLT 2012, 2012, Taipei, Taiwan. pp.62-72, ⟨10.1007/978-3-642-31653-1_7⟩. ⟨hal-00737688⟩
  • Thomas Colcombet, Denis Kuperberg, Sylvain Lombardy. Regular Temporal Cost Functions. International Colloquium on Automata, Languages and Programming (ICALP), 2010, Bordeaux, France. pp.563-574. ⟨hal-00859355⟩
  • Sylvain Lombardy, Jacques Sakarovitch. Radix cross-sections for length morphisms. 9th Latin American Theoretical Informatics Symposium (LATIN'10), 2010, United States. pp.184-195. ⟨hal-00620325⟩
  • Daniel Kirsten, Sylvain Lombardy. Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.589-600. ⟨inria-00360205⟩
  • Pierre-Yves Angrand, Sylvain Lombardy, Jacques Sakarovitch. On the number of broken derived terms of a rational expression. 11th Workshop on Descriptional Complexity of Formal Systems (DCFS'09), 2009, Magdeburg, Germany. pp.79-90. ⟨hal-00620323⟩
  • Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin. Embeddings of local automata. IEEE International Symposium on Information Theory (ISIT'08), Jul 2008, United States. pp.2351-2355. ⟨hal-00620271⟩
  • Akim Demaille, Alexandre Duret-Lutz, Florian Lesaint, Sylvain Lombardy, Jacques Sakarovitch, et al.. An XML Format Proposal for the Description of Weighted Automata, Transducers and Regular Expressions. Finite-State Methods and Natural Language Processing, 2008, Ispra, Italy. pp.199-206. ⟨hal-00859354⟩
  • Sylvain Lombardy. On the size of the universal automaton of a regular language. STACS'07, Feb 2007, Germany. pp.85--96. ⟨hal-00139652⟩
  • Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch. Conjugacy and Equivalence of Weighted Automata and Functional Transducers. 1st International Computer Science Symposium in Russia (CSR 2006), Jun 2006, St. Petersburg, Russia. pp.58-69. ⟨hal-00619855⟩
  • Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch. On the equivalence of Z-automata. 2005, pp.397-409, ⟨10.1007/11523468_33⟩. ⟨hal-00017406⟩
  • Thomas Claveirole, Sylvain Lombardy, Sarah Oconnor, Louis-Noël Pouchet, Jacques Sakarovitch. Inside Vaucanson. 10th International Conference on Implementation and Application of Automata (CIAA 2005), Jun 2005, Sophia Antipolis, France, France. pp.116-128. ⟨hal-00619840⟩
  • Sylvain Lombardy, Jacques Sakarovitch. How expressions can code for automata. 6th Latin American Theoretical INformatics (LATIN'04), Apr 2004, Buenos Aires, Argentina, Argentina. pp.242-251. ⟨hal-00620053⟩
  • Sylvain Lombardy, Raphaël Poss, Yann Régis-Gianas, Jacques Sakarovitch. Introducing Vaucanson. 8th International Conference on Implementation and Application of Automata (CIAA 2003), Jul 2003, Santa Barbara, California, USA, United States. pp.96-107. ⟨hal-00620038⟩
  • Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur. Deciding the sequentiality of a finitely ambiguous Max-Plus automaton. 2003, pp.373-385. ⟨hal-00017208⟩
  • Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur. Deciding the sequentiality of a finitely ambiguous max-plus automaton. 7th International Conference on Developments in Language Theory (DLT 2003), Jul 2003, Szeged, Hungary, Hungary. pp.373-385. ⟨hal-00620031⟩
  • Sylvain Lombardy, Jacques Sakarovitch. On the star height of rational languages: a new presentation for two old results. 3rd International Conference on Languages, Words and Combinatorics, 2003, Kyoto, Japan, Japan. pp.266-285. ⟨hal-00620802⟩
  • Sylvain Lombardy, Jacques Sakarovitch. Derivation of rational expressions with multiplicity. 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002), Aug 2002, Warsaw, Poland, Poland. pp.471-482. ⟨hal-00620039⟩
  • Sylvain Lombardy. On the construction of reversible automata for reversible languages. 29th International Colloquium on Automata, Languages and Programming (ICALP 2002), Jul 2002, Malaga, Spain, Spain. pp.170-182. ⟨hal-00620037⟩
  • Sylvain Lombardy, Jacques Sakarovitch. Star height of reversible languages and universal automata.. 2002, pp.76-89. ⟨hal-00017159⟩
  • Sylvain Lombardy. Sequentialization and unambiguity of (max,+) rational series over one letter. Workshop on max-plus algebras and Their Applications to Discrete-event Systems, Theoretical Computer Science, and Optimization, 2001, Prague, Czech Republic. 6pp. ⟨hal-00620035⟩

Book sections1 document

  • Sylvain Lombardy, Jacques Sakarovitch. The universal automaton. Flum Jörg, Grädel Erich, Wilke Thomas. Logic and Automata, History and Perspectives, 2, Amsterdam University Press, pp.457-504, 2008, Texts in Logic and Games. ⟨hal-00620807⟩

Preprints, Working Papers, ...1 document

Reports1 document

  • Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin. Embeddings of automata. 2007. ⟨hal-00627816⟩

Theses1 document

  • Sylvain Lombardy. Approche structurelle de quelques problèmes de la théorie des automates. Théorie et langage formel [cs.FL]. Ecole nationale supérieure des telecommunications - ENST, 2001. Français. ⟨tel-00737830⟩

Habilitation à diriger des recherches1 document

  • Sylvain Lombardy. Contribution aux problèmes de réalisation des langages et séries rationnels. Informatique [cs]. Université Paris-Diderot - Paris VII, 2005. ⟨tel-00637128⟩