Sylvain Lombardy

58 papers A* 2A 3B 8C 12Misc 1Journal 21Unranked 8

Year	Rank	Type	Title / Venue / Authors
2023	B	`ed.`	48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, Bordeaux, France, August 28 - September 1, 2023 MFCS Jérôme Leroux, Sylvain Lombardy, David Peleg
2022	J	`jnl`	Morphisms and Minimisation of Weighted Automata. Fundam. Informaticae Sylvain Lombardy, Jacques Sakarovitch
2022	B	`conf`	The Net Automaton of a Rational Expression. LATIN Sylvain Lombardy, Jacques Sakarovitch
2021	J	`jnl`	Derived terms without derivation a shifted perspective on the derived-term automaton. CoRR Sylvain Lombardy, Jacques Sakarovitch
2021	—	`ch.`	Max-plus automata. Handbook of Automata Theory (I.) Sylvain Lombardy, Jean Mairesse
2021	J	`jnl`	Morphisms and minimization of weighted automata. CoRR Sylvain Lombardy, Jacques Sakarovitch
2020	A	`conf`	Unambiguous Separators for Tropical Tree Automata. STACS Thomas Colcombet, Sylvain Lombardy
2019	J	`jnl`	From Hadamard expressions to weighted rotating automata and back. Theor. Comput. Sci. Louis-Marie Dando, Sylvain Lombardy
2019	J	`jnl`	Unambiguous separators for tropical tree automata. CoRR Thomas Colcombet, Sylvain Lombardy
2018	B	`conf`	On Hadamard Series and Rotating Q-Automata. MFCS Louis-Marie Dando, Sylvain Lombardy
2018	C	`conf`	The Validity of Weighted Automata. CIAA Sylvain Lombardy, Jacques Sakarovitch
2018	C	`conf`	Two Routes to Automata Minimization and the Ways to Reach It Efficiently. CIAA Sylvain Lombardy, Jacques Sakarovitch
2018	—	`conf`	Two-Way Automata over Locally Finite Semirings. DCFS Louis-Marie Dando, Sylvain Lombardy
2017	C	`conf`	From Hadamard Expressions to Weighted Rotating Automata and Back. CIAA Louis-Marie Dando, Sylvain Lombardy
2016	J	`jnl`	Two-way representations and weighted automata. RAIRO Theor. Informatics Appl. Sylvain Lombardy
2015	J	`jnl`	On Determinism and Unambiguity of Weighted Two-Way Automata. Int. J. Found. Comput. Sci. Vincent Carnino, Sylvain Lombardy
2015	—	`conf`	Weighted two-way automata. NCMA Sylvain Lombardy
2014	C	`conf`	A Type System for Weighted Automata and Rational Expressions. CIAA Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Luca Saiu, Jacques Sakarovitch
2014	J	`jnl`	Factorizations and Universal Automaton of omega Languages. Int. J. Found. Comput. Sci. Vincent Carnino, Sylvain Lombardy
2014	—	`conf`	On Determinism and Unambiguity of Weighted Two-way Automata. AFL Vincent Carnino, Sylvain Lombardy
2014	—	`conf`	Tropical Two-Way Automata. IFIP TCS Vincent Carnino, Sylvain Lombardy
2013	C	`conf`	Factorizations and Universal Automaton of Omega Languages. Developments in Language Theory Vincent Carnino, Sylvain Lombardy
2013	C	`conf`	Implementation Concepts in Vaucanson 2. CIAA Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Jacques Sakarovitch
2013	J	`jnl`	The Validity of Weighted Automata. Int. J. Algebra Comput. Sylvain Lombardy, Jacques Sakarovitch
2012	C	`conf`	Decidability of Geometricity of Regular Languages. Developments in Language Theory Marie-Pierre Béal, Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Sylvain Lombardy
2012	C	`conf`	Factor and Subsequence Kernels and Signatures of Rational Languages. CIAA Ahmed Amarni, Sylvain Lombardy
2012	J	`jnl`	On the Finiteness Problem for Automaton (Semi)Groups. Int. J. Algebra Comput. Ali Akhavi, Ines Klimann, Sylvain Lombardy, Jean Mairesse, Matthieu Picantin
2012	C	`conf`	The Removal of Weighted ε-Transitions. CIAA Sylvain Lombardy, Jacques Sakarovitch
2011	J	`jnl`	On the Finiteness Problem for Automaton (Semi)groups CoRR Ali Akhavi, Ines Klimann, Sylvain Lombardy, Jean Mairesse, Matthieu Picantin
2010	J	`jnl`	Corrigendum to our paper: How Expressions Can Code for Automata. RAIRO Theor. Informatics Appl. Sylvain Lombardy, Jacques Sakarovitch
2010	J	`jnl`	On the Number of Broken Derived Terms of a Rational Expression. J. Autom. Lang. Comb. Pierre-Yves Angrand, Sylvain Lombardy, Jacques Sakarovitch
2010	B	`conf`	Radix Cross-Sections for Length Morphisms. LATIN Sylvain Lombardy, Jacques Sakarovitch
2010	—	`conf`	Regular Temporal Cost Functions. ICALP (2) Thomas Colcombet, Denis Kuperberg, Sylvain Lombardy
2009	A	`conf`	Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata. STACS Daniel Kirsten, Sylvain Lombardy
2008	—	`conf`	An XML Format Proposal for the Description of Weighted Automata, Transducers and Regular Expressions. FSMNLP Akim Demaille, Alexandre Duret-Lutz, Florian Lesaint, Sylvain Lombardy, Jacques Sakarovitch, Florent Terrones
2008	B	`conf`	Embeddings of local automata. ISIT Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin
2008	—	`conf`	The universal automaton. Logic and Automata Sylvain Lombardy, Jacques Sakarovitch
2007	J	`jnl`	Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton CoRR Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur
2007	A	`conf`	On the Size of the Universal Automaton of a Regular Language. STACS Sylvain Lombardy
2007	J	`jnl`	Series which are both max-plus and min-plus rational are unambiguous CoRR Sylvain Lombardy, Jean Mairesse
2006	Misc	`conf`	Conjugacy and Equivalence of Weighted Automata and Functional Transducers. CSR Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch
2006	J	`jnl`	Sequential? Theor. Comput. Sci. Sylvain Lombardy, Jacques Sakarovitch
2006	J	`jnl`	Series which are both max-plus and min-plus rational are unambiguous. RAIRO Theor. Informatics Appl. Sylvain Lombardy, Jean Mairesse
2005	—	`book`	Contribution aux problèmes de réalisation des langages et séries rationnels. Sylvain Lombardy
2005	J	`jnl`	Derivatives of rational expressions with multiplicity. Theor. Comput. Sci. Sylvain Lombardy, Jacques Sakarovitch
2005	J	`jnl`	How expressions can code for automata. RAIRO Theor. Informatics Appl. Sylvain Lombardy, Jacques Sakarovitch
2005	C	`conf`	Inside Vaucanson. CIAA Thomas Claveirole, Sylvain Lombardy, Sarah O'Connor, Louis-Noël Pouchet, Jacques Sakarovitch
2005	A*	`conf`	On the Equivalence of -Automata. ICALP Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch
2004	J	`jnl`	Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton. Theor. Comput. Sci. Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur
2004	B	`conf`	How Expressions Can Code for Automata. LATIN Sylvain Lombardy, Jacques Sakarovitch
2004	J	`jnl`	Introducing VA Theor. Comput. Sci. Sylvain Lombardy, Yann Régis-Gianas, Jacques Sakarovitch
2003	C	`conf`	Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton. Developments in Language Theory Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur
2003	C	`conf`	Introducing VAUCANSON. CIAA Sylvain Lombardy, Raphael Poss, Yann Régis-Gianas, Jacques Sakarovitch
2002	B	`conf`	Derivation of Rational Expressions with Multiplicity. MFCS Sylvain Lombardy, Jacques Sakarovitch
2002	A*	`conf`	On the Construction of Reversible Automata for Reversible Languages. ICALP Sylvain Lombardy
2002	B	`conf`	Star Height of Reversible Languages and Universal Automata. LATIN Sylvain Lombardy, Jacques Sakarovitch
2001	—	`—`	Approche structurelle de quelques problèmes de la théorie des automates. Sylvain Lombardy
2000	—	`conf`	On the Star Height of Rational Languages: A New Presentation for Two Old Results. Words, Languages & Combinatorics Sylvain Lombardy, Jacques Sakarovitch