Sylvain Lombardy
55
Documents
Publications
|
Morphisms and minimisation of weighted automataFundamenta Informaticae, 2022, 186 (1-4), pp.195-218. ⟨10.3233/FI-222126⟩
Article dans une revue
hal-03483922v5
|
|
Derived Terms without Derivation -- A shifted perspective on the derived-term automatonJournal of Computer Science and Cybernetics, Vietnamese Academy of Science and Technology, Vietnam, 2021, 37 (3), pp.201-221. ⟨10.15625/1813-9663/37/3/16263⟩
Article dans une revue
hal-03382261v1
|
|
From Hadamard expressions to weighted rotating automata and backTheoretical Computer Science, 2019, 787, pp.28-44. ⟨10.1016/j.tcs.2018.09.017⟩
Article dans une revue
hal-02290010v1
|
Two-way representations and weighted automataRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2016, 7th Non-Classical Models of Automata and Applications (NCMA-2015), 50 (4), pp.331-350. ⟨10.1051/ita/2016026⟩
Article dans une revue
hal-01484284v1
|
|
On Determinism and Unambiguity of Weighted Two-Way AutomataInternational Journal of Foundations of Computer Science, 2015, Special Issue – Automata and Formal Languages (AFL 2014), 26 (8), pp.1127-1146. ⟨10.1142/S0129054115400158⟩
Article dans une revue
hal-01326283v1
|
|
Factorizations and universal automaton of omega languagesInternational Journal of Foundations of Computer Science, 2014, Special Issue – Developments in Language Theory (DLT 2013), 25 (8), pp.1111-1125. ⟨10.1142/S0129054114400279⟩
Article dans une revue
hal-01120568v1
|
|
The validity of weighted automataInternational Journal of Algebra and Computation, 2013, 23, pp.863-913. ⟨10.1142/S0218196713400146⟩
Article dans une revue
hal-00845820v1
|
|
On the finiteness problem for automaton (semi)groupsInternational Journal of Algebra and Computation, 2012, 22 (06), pp.1250052.1-1250052.26. ⟨10.1142/S021819671250052X⟩
Article dans une revue
hal-00695445v1
|
|
On the Number of Broken Derived Terms of a Rational ExpressionJournal of Automata Languages and Combinatorics, 2012, 15 (1/2), pp.27-51
Article dans une revue
hal-00860155v1
|
|
|
Embeddings of local automataIllinois Journal of Mathematics, 2010, 54 (1), pp.155-174
Article dans une revue
hal-00619770v1
|
Corrigendum to our paper : How Expressions can code for AutomataRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2010, 44 (3), pp.339--361. ⟨10.1051/ita/2010019⟩
Article dans une revue
hal-00692898v1
|
|
Sequential ?Theoretical Computer Science, 2006, 356, pp.224 -- 244. ⟨10.1016/j.tcs.2006.01.028⟩
Article dans une revue
hal-00069863v1
|
|
|
Series which are both max-plus and min-plus rational are unambiguousRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2006, 40, pp.1-14. ⟨10.1051/ita:2005042⟩
Article dans une revue
hal-00017220v1
|
How expressions can code for automataRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2005, 39, pp.217-237. ⟨10.1051/ita:2005013⟩
Article dans une revue
hal-00016385v1
|
|
Introducing VaucansonTheoretical Computer Science, 2004, 328, pp.77-96. ⟨10.1016/j.tcs.2004.07.007⟩
Article dans une revue
hal-00017540v1
|
|
|
Deciding Unambiguity and Sequentiality from a Finitely Ambiguous Max-Plus AutomatonTheoretical Computer Science, 2004, 327 (3), pp.349-373. ⟨10.1016/j.tcs.2004.02.049⟩
Article dans une revue
hal-00174171v1
|
Derivatives of rational expressions with multiplicityTheoretical Computer Science, 2004, 332, pp.141-177. ⟨10.1016/j.tcs.2004.10.016⟩
Article dans une revue
hal-00017202v1
|
The Net Automaton of a Rational ExpressionLATIN 2022: LATIN 2022: Theoretical Informatics, Armando Castañeda, Francisco Rodríguez-Henríquez, Nov 2022, Guanajuato, Mexico. pp.376-392, ⟨10.1007/978-3-031-20624-5_23⟩
Communication dans un congrès
hal-03986317v1
|
|
|
Unambiguous Separators for Tropical Tree Automata37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, Mar 2020, Montpellier, France. pp.32:1-32:13, ⟨10.4230/LIPIcs.STACS.2020.32⟩
Communication dans un congrès
hal-03106897v1
|
Two Routes to Automata Minimization and the Ways to Reach It EfficientlyInternational Conference on Implementation and Application of Automata, CIAA 2018, Jul 2018, Charlottetown, Canada. pp.248-260, ⟨10.1007/978-3-319-94812-6_21⟩
Communication dans un congrès
hal-01866176v1
|
|
On Hadamard Series and Rotating Q-AutomataMathematical 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⟩
Communication dans un congrès
hal-01866198v1
|
|
|
Two-Way Automata over Locally Finite Semirings20th 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⟩
Communication dans un congrès
hal-01866160v1
|
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⟩
Communication dans un congrès
hal-01544105v1
|
|
A Type System for Weighted Automata and Rational ExpressionsImplementation and Application of Automata, CIAA 2014, Jul 2014, Giessen, Germany. pp.162--175, ⟨10.1007/978-3-319-08846-4_12⟩
Communication dans un congrès
hal-01069654v1
|
|
|
On Determinism and Unambiguity of Weighted Two-way Automata14th International Conference on Automata and Formal Languages, May 2014, Szeged, Hungary. pp.188-200, ⟨10.4204/EPTCS.151.13⟩
Communication dans un congrès
hal-01008785v1
|
|
Tropical Two-Way Automata8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.195-206, ⟨10.1007/978-3-662-44602-7_16⟩
Communication dans un congrès
hal-01069637v1
|
|
Factorizations and Universal Automaton of Omega LanguagesDevelopments 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⟩
Communication dans un congrès
hal-00841873v1
|
Implementation Concepts in Vaucanson 2Implementation and Application of Automata, CIAA 2013, Jul 2013, Halifax, Canada. pp.122-133, ⟨10.1007/978-3-642-39274-0_12⟩
Communication dans un congrès
hal-00845816v1
|
|
Factor and Subsequence Kernels and Signatures of Rational Languages17th International Conference, CIAA 2012, 2012, Porto, Portugal. pp.313-320, ⟨10.1007/978-3-642-31606-7_27⟩
Communication dans un congrès
hal-00737676v1
|
|
|
Decidability of Geometricity of Regular Languages16th International Conference, DLT 2012, 2012, Taipei, Taiwan. pp.62-72, ⟨10.1007/978-3-642-31653-1_7⟩
Communication dans un congrès
hal-00737688v1
|
The Removal of Weighted ε-Transitions17th International Conference, CIAA 2012, 2012, Porto, Portugal. pp.345-352, ⟨10.1007/978-3-642-31606-7_31⟩
Communication dans un congrès
hal-00737679v1
|
|
Radix cross-sections for length morphisms9th Latin American Theoretical Informatics Symposium (LATIN'10), 2010, United States. pp.184-195
Communication dans un congrès
hal-00620325v1
|
|
|
Regular Temporal Cost FunctionsInternational Colloquium on Automata, Languages and Programming (ICALP), 2010, Bordeaux, France. pp.563-574
Communication dans un congrès
hal-00859355v1
|
|
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.589-600
Communication dans un congrès
inria-00360205v1
|
On the number of broken derived terms of a rational expression11th Workshop on Descriptional Complexity of Formal Systems (DCFS'09), 2009, Magdeburg, Germany. pp.79-90
Communication dans un congrès
hal-00620323v1
|
|
|
An XML Format Proposal for the Description of Weighted Automata, Transducers and Regular ExpressionsFinite-State Methods and Natural Language Processing, 2008, Ispra, Italy. pp.199-206
Communication dans un congrès
hal-00859354v1
|
|
Embeddings of local automataIEEE International Symposium on Information Theory (ISIT'08), Jul 2008, United States. pp.2351-2355
Communication dans un congrès
hal-00620271v1
|
On the size of the universal automaton of a regular languageSTACS'07, Feb 2007, BERLIN, Germany. pp.85--96, ⟨10.1007/978-3-540-70918-3_8⟩
Communication dans un congrès
hal-00139652v1
|
|
|
Conjugacy and Equivalence of Weighted Automata and Functional Transducers1st International Computer Science Symposium in Russia (CSR 2006), Jun 2006, St. Petersburg, Russia. pp.58-69
Communication dans un congrès
hal-00619855v1
|
On the equivalence of Z-automata2005, pp.397-409, ⟨10.1007/11523468_33⟩
Communication dans un congrès
hal-00017406v1
|
|
Inside Vaucanson10th International Conference on Implementation and Application of Automata (CIAA 2005), Jun 2005, Sophia Antipolis, France, France. pp.116-128
Communication dans un congrès
hal-00619840v1
|
|
How expressions can code for automata6th Latin American Theoretical INformatics (LATIN'04), Apr 2004, Buenos Aires, Argentina, Argentina. pp.242-251
Communication dans un congrès
hal-00620053v1
|
|
Introducing Vaucanson8th International Conference on Implementation and Application of Automata (CIAA 2003), Jul 2003, Santa Barbara, California, USA, United States. pp.96-107
Communication dans un congrès
hal-00620038v1
|
|
Deciding the sequentiality of a finitely ambiguous max-plus automaton7th International Conference on Developments in Language Theory (DLT 2003), Jul 2003, Szeged, Hungary, Hungary. pp.373-385
Communication dans un congrès
hal-00620031v1
|
|
On the star height of rational languages: a new presentation for two old results3rd International Conference on Languages, Words and Combinatorics, 2003, Kyoto, Japan, Japan. pp.266-285
Communication dans un congrès
hal-00620802v1
|
|
Deciding the sequentiality of a finitely ambiguous Max-Plus automaton2003, pp.373-385
Communication dans un congrès
hal-00017208v1
|
|
Star height of reversible languages and universal automata.2002, pp.76-89
Communication dans un congrès
hal-00017159v1
|
|
|
On the construction of reversible automata for reversible languages29th International Colloquium on Automata, Languages and Programming (ICALP 2002), Jul 2002, Malaga, Spain, Spain. pp.170-182
Communication dans un congrès
hal-00620037v1
|
Derivation of rational expressions with multiplicity27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002), Aug 2002, Warsaw, Poland, Poland. pp.471-482
Communication dans un congrès
hal-00620039v1
|
|
|
Sequentialization and unambiguity of (max,+) rational series over one letterWorkshop on max-plus algebras and Their Applications to Discrete-event Systems, Theoretical Computer Science, and Optimization, 2001, Prague, Czech Republic. 6pp
Communication dans un congrès
hal-00620035v1
|
The universal automatonFlum 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
Chapitre d'ouvrage
hal-00620807v1
|
|
Two-Way Representations and Weighted Automata2015
Pré-publication, Document de travail
hal-01187754v1
|
|
Embeddings of automata2007
Rapport
hal-00627816v1
|
|
Approche structurelle de quelques problèmes de la théorie des automatesThéorie et langage formel [cs.FL]. Ecole nationale supérieure des telecommunications - ENST, 2001. Français. ⟨NNT : ⟩
Thèse
tel-00737830v1
|
|
Contribution aux problèmes de réalisation des langages et séries rationnelsInformatique [cs]. Université Paris-Diderot - Paris VII, 2005
HDR
tel-00637128v1
|