The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sylvain Lombardy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch
    Conjugacy and Equivalence of Weighted Automata and Functional Transducers. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:58-69 [Conf]
  2. Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur
    Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:373-385 [Conf]
  3. Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch
    On the Equivalence of -Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:397-409 [Conf]
  4. Sylvain Lombardy
    On the Construction of Reversible Automata for Reversible Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:170-182 [Conf]
  5. Sylvain Lombardy, Jacques Sakarovitch
    Star Height of Reversible Languages and Universal Automata. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:76-90 [Conf]
  6. Sylvain Lombardy, Jacques Sakarovitch
    How Expressions Can Code for Automata. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:242-251 [Conf]
  7. Sylvain Lombardy, Jacques Sakarovitch
    Derivation of Rational Expressions with Multiplicity. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:471-482 [Conf]
  8. Sylvain Lombardy
    On the Size of the Universal Automaton of a Regular Language. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:85-96 [Conf]
  9. Thomas Claveirole, Sylvain Lombardy, Sarah O'Connor, Louis-Noël Pouchet, Jacques Sakarovitch
    Inside Vaucanson. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:116-128 [Conf]
  10. Sylvain Lombardy, Raphaël Poss, Yann Régis-Gianas, Jacques Sakarovitch
    Introducing VAUCANSON. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:96-107 [Conf]
  11. Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur
    Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:327, n:3, pp:349-373 [Journal]
  12. Sylvain Lombardy, Yann Régis-Gianas, Jacques Sakarovitch
    Introducing VAUCANSON. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:328, n:1-2, pp:77-96 [Journal]
  13. Sylvain Lombardy, Jacques Sakarovitch
    Derivatives of rational expressions with multiplicity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:141-177 [Journal]
  14. Sylvain Lombardy, Jacques Sakarovitch
    Sequential? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:1-2, pp:224-244 [Journal]
  15. Sylvain Lombardy, Jean Mairesse
    Series which are both max-plus and min-plus rational are unambiguous [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  16. Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur
    Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  17. Regular Temporal Cost Functions. [Citation Graph (, )][DBLP]


  18. Radix Cross-Sections for Length Morphisms. [Citation Graph (, )][DBLP]


  19. Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata. [Citation Graph (, )][DBLP]


  20. An XML Format Proposal for the Description of Weighted Automata, Transducers and Regular Expressions. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002