Universal automaton, star height, reversible languages

• On the star height of rational languages. A new proof for two old results.
  (with Jacques Sakarovitch)
  - Technical Report ENST, 2001 (Postscript,pdf)
  - Proc. of 3rd Int. Conf. on Languages, Words and Combinatorics, Kyoto 00 (M. Ito, ed.), (World Scientific, 2003) 266-285. (Postscript,pdf) (bibtex)
  
• Star height of reversible languages and universal automata.
  (with Jacques Sakarovitch)
  - Talk at Latin 2002 (Slides)
  - Latin 2002, Lect. Notes in Comp. Sci., 2286 (Springer, 2002), 76-89. (Postscript,pdf) (bibtex)
  
• On the construction of reversible automata for reversible languages.
  - Talk at ICALP'02 (Slides)
  - ICALP 2002, Lect. Notes in Comp. Sci., 2380 (Springer, 2002), 170-182. (Postscript,pdf) (bibtex)
  
• On the size of the universal automaton of a regular language.
  - Talk at STACS'07
  - STACS 2007, Lect. Notes in Comp. Sci., 4393 (Springer, 2007), 85-96.
  

Rational expressions, conversion into automata

• Derivatives of rational expressions with multiplicity.
  (with Jacques Sakarovitch)
  - Technical Report ENST, 2001 (Postscript,pdf)
  - MFCS 2002, Lect. Notes in Comp. Sci., 2420 (Springer, 2002), 471-482.
  - Journal version: TCS 332 (Elsevier, 2005), 141-177. (Postscript)(bibtex)
• How expressions can code for automata.
  (with Jacques Sakarovitch)
  - Latin 2004, Lect. Notes in Comp. Sci., 2976 (Springer, 2004), 242-251. (bibtex)
  - Journal version: ITA 39.1 (EDP Sciences, 2005), 217-237. (Postscript)
  

Max-plus automata, sequentialization

• Sequentialization and unambiguity of (max,+) rational series over one letter.
  - Talk at the Satellite Workshop on Max-Plus Algebras, IFAC SSSC'01, Prague, Elsevier. (Postscript,pdf)
  
• Deciding the sequentiality of a finitely ambiguous Max-Plus automaton.
  (with Ines Klimann, Jean Mairesse and Christophe Prieur)
  - Talk at DLT'03 (Slides)
  - DLT 2003, Lect. Notes in Comp. Sci., 2710 (Springer, 2003), 373-385. (bibtex)
  
• Deciding unambiguity and sequentiality from a finitely ambiguous Max-Plus automaton.
  (with Ines Klimann, Jean Mairesse et Christophe Prieur)
  - Technical report LIAFA
  - Journal version: TCS 327(3) (Elsevier, 2004), 349-373. (Postscript)(bibtex)
  
• Series which are both max-plus and min-plus rational are unambiguous.
  (with Jean Mairesse)
  - Talk at WATA 2004
  - Technical report LIAFA
  - Journal version: ITA 40 (EDP sciences, 2006), 1-14. (Postscript)
• Sequential ?
  (with Jacques Sakarovitch)
  - Survey: TCS 356(1-2) (Elsevier, 2006), 224-244.

Vaucanson

• Introducing Vaucanson.
  (with Raphaël Poss, Yann Régis-Gianas and Jacques Sakarovitch)
  - CIAA 2003, Lect. Notes in Comp. Sci., 2759 (Springer, 2003), 96-107.
  - Journal version: TCS 328 (Elsevier, 2004), 77-96.
  
• Inside Vaucanson.
  (with Thomas Claveirole, Louis-Noël Pouchet et Jacques Sakarovitch)
  - CIAA 2005, Lect. Notes in Comp. Sci., 3845 (Springer, 2006), 116-128. (bibtex)
  
  

Weighted automata

• On the equivalence of Z-automata
  (with Marie-Pierre Béal et Jacques Sakarovitch)
  - ICALP 2005, Lect. Notes in Comp. Sci., 3580 (Springer, 2005), 397-409.
  
• Conjugacy and equivalence of weighted automata and functional transducers
  (with Marie-Pierre Béal et Jacques Sakarovitch)
  - CSR 2006, Lect. Notes in Comp. Sci., 3967 (Springer, 2006), 58-69. (bibtex)
  - Some slides

• full version (gzipped postscript, 800Ko)
  (original french version, no subtitles !, Bonus: front cover)
  
  
• Chapters:
  
  
  • 1.Basic notions
    
    
  • 2.Universal automaton
    
    
  • 3.universal automata and reversible languages
    
    
  • 4.Star height
    
    
  • 5.Déterminizing (max,+) automata (independent from 2,3,4,6)
    
    
  • 6.Dérivation of rational expressions with multiplicity (independent from 2,3,4,5)