The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jacques Sakarovitch: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean-François Perrot, Jacques Sakarovitch
    Langages algébriques déterministes et groupes abeliens. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:20-30 [Conf]
  2. 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]
  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. Jacques Sakarovitch
    Sur les monoïdes syntactiques des langages algébriques déterministes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:52-65 [Conf]
  5. Maryse Pelletier, Jacques Sakarovitch
    On the Lexicographic Uniformisation of Deterministic 2-Tape Automata (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:485-490 [Conf]
  6. Jean-François Perrot, Jacques Sakarovitch
    A Theory of Syntactic Monoids for Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1977, pp:69-72 [Conf]
  7. Jacques Sakarovitch
    Kleene's theorem revisited. [Citation Graph (0, 0)][DBLP]
    IMYCS, 1986, pp:39-50 [Conf]
  8. Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch
    Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:397-406 [Conf]
  9. Sylvain Lombardy, Jacques Sakarovitch
    Star Height of Reversible Languages and Universal Automata. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:76-90 [Conf]
  10. Sylvain Lombardy, Jacques Sakarovitch
    How Expressions Can Code for Automata. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:242-251 [Conf]
  11. Jacques Sakarovitch
    The "Last" Decision Problem for Rational Trace Languages. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:460-473 [Conf]
  12. Jean Berstel, Jacques Sakarovitch
    Recent Results in the Theory of Rational Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:15-28 [Conf]
  13. Sylvain Lombardy, Jacques Sakarovitch
    Derivation of Rational Expressions with Multiplicity. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:471-482 [Conf]
  14. Fabienne Romanian, Jacques Sakarovitch
    One-Sided Dyck Reduction Over Two Letter Alphabet and Deterministic Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:554-563 [Conf]
  15. Jacques Sakarovitch
    An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:510-516 [Conf]
  16. Christiane Frougny, Jacques Sakarovitch
    A Rewrite System Associated with Quadratic Pisot Units. [Citation Graph (0, 0)][DBLP]
    RTA, 1999, pp:356-370 [Conf]
  17. Christiane Frougny, Jacques Sakarovitch
    Rational Ralations with Bounded Delay. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:50-63 [Conf]
  18. Jean-Eric Pin, Jacques Sakarovitch
    Some operations and transductions that preserve rationality. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:277-288 [Conf]
  19. Jacques Sakarovitch
    Théorème de transversale rationnelle pour les automates à pile déterministes. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:276-285 [Conf]
  20. 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]
  21. Sylvain Lombardy, Raphaël Poss, Yann Régis-Gianas, Jacques Sakarovitch
    Introducing VAUCANSON. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:96-107 [Conf]
  22. Jacques Sakarovitch
    The Language, the Expression, and the (Small) Automaton. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:15-30 [Conf]
  23. Christiane Frougny, Jacques Sakarovitch, Erich Valkema
    On the Hotz Group of a Context-Free Grammar. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1982, v:18, n:, pp:109-115 [Journal]
  24. Jacques Sakarovitch
    Description des monoïdes de type fini. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1981, v:17, n:8/9, pp:417-434 [Journal]
  25. Maryse Pelletier, Jacques Sakarovitch
    Easy Multiplications II. Extensions of Rational Semigroups [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:88, n:1, pp:18-59 [Journal]
  26. Jacques Sakarovitch
    Easy Multiplications. I. The Realm of Kleene's Theorem [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1987, v:74, n:3, pp:173-197 [Journal]
  27. Christiane Frougny, Jacques Sakarovitch
    Two Groups Associated with Quadratic Pisot Units. [Citation Graph (0, 0)][DBLP]
    IJAC, 2002, v:12, n:6, pp:825-847 [Journal]
  28. M. Benois, Jacques Sakarovitch
    On the Complexity of Some Extended Word Problems Defined by Cancellation Rules. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:23, n:6, pp:281-287 [Journal]
  29. Jacques Sakarovitch
    Deux Remarques sur un Théorème de S. Eilenberg. [Citation Graph (0, 0)][DBLP]
    ITA, 1983, v:17, n:1, pp:23-48 [Journal]
  30. Jacques Sakarovitch
    Sur une Propriété d'Itération des Langages Algébriques Déterministes. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1981, v:14, n:, pp:247-288 [Journal]
  31. Jacques Sakarovitch, Taishin Y. Nishida, Youichi Kobuchi
    Recurrent Words for Substitution. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1984, v:17, n:3, pp:199-215 [Journal]
  32. Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch
    Squaring transducers: an efficient procedure for deciding functionality and sequentiality. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:45-63 [Journal]
  33. Christiane Frougny, Jacques Sakarovitch
    Synchronized Rational Relations of Finite and Infinite Words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:108, n:1, pp:45-82 [Journal]
  34. Christiane Frougny, Jacques Sakarovitch
    Synchronisation déterministe des automates à délai borné. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:191, n:1-2, pp:61-77 [Journal]
  35. 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]
  36. 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]
  37. Sylvain Lombardy, Jacques Sakarovitch
    Sequential? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:1-2, pp:224-244 [Journal]
  38. Maryse Pelletier, Jacques Sakarovitch
    On the Representation of Finite Deterministic 2-Tape Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:225, n:1-2, pp:1-63 [Journal]
  39. Jean-Eric Pin, Jacques Sakarovitch
    Une Application de la Representation Matricielle des Transductions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:271-293 [Journal]
  40. Jacques Sakarovitch
    On Regular Trace Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:52, n:, pp:59-75 [Journal]
  41. Jacques Sakarovitch
    A Construction on Finite Automata that has Remained Hidden. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:204, n:1-2, pp:205-231 [Journal]
  42. Jacques Sakarovitch
    Finite Automata and the Writing of Numbers. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2007, pp:29-30 [Conf]

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


  44. On the Decidability of Bounded Valuedness for Transducers. [Citation Graph (, )][DBLP]


  45. On the decomposition of k-valued rational relations. [Citation Graph (, )][DBLP]


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


  47. On the decomposition of k-valued rational relations [Citation Graph (, )][DBLP]


  48. On the Minimal Uncompletable Word Problem [Citation Graph (, )][DBLP]


Search in 0.694secs, Finished in 0.697secs
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