Jacques Sakarovitch

Victor Marsault, Jacques Sakarovitch: Ultimate periodicity of b-recognisable sets : a quasilinear procedure. CoRR abs/1301.2691 (2013)

Sylvain Lombardy, Jacques Sakarovitch: The Removal of Weighted ε-Transitions. CIAA 2012: 345-352

Victor Marsault, Jacques Sakarovitch: On sets of numbers rationally represented in a rational base number system. CoRR abs/1208.5412 (2012)

Anssi Yli-Jyrä, András Kornai, Jacques Sakarovitch: Finite-state methods and models in natural language processing. Natural Language Engineering 17(2): 141-144 (2011)

Pierre-Yves Angrand, Jacques Sakarovitch: On the enumerating series of an abstract numeration system. CoRR abs/1108.5711 (2011)

Pierre-Yves Angrand, Jacques Sakarovitch: Radix enumeration of rational languages. RAIRO - Theor. Inf. and Applic. 44(1): 19-36 (2010)

Sylvain Lombardy, Jacques Sakarovitch: Corrigendum to our paper: How Expressions Can Code for Automata. RAIRO - Theor. Inf. and Applic. 44(3): 339-361 (2010)

Pierre-Yves Angrand, Sylvain Lombardy, Jacques Sakarovitch: On the Number of Broken Derived Terms of a Rational Expression. Journal of Automata, Languages and Combinatorics 15(1/2): 27-51 (2010)

Jacques Sakarovitch, Rodrigo de Souza: Lexicographic Decomposition of k-Valued Transducers. Theory Comput. Syst. 47(3): 758-785 (2010)

Sylvain Lombardy, Jacques Sakarovitch: Radix Cross-Sections for Length Morphisms. LATIN 2010: 184-195

Anssi Yli-Jyrä, András Kornai, Jacques Sakarovitch, Bruce W. Watson (Eds.): Finite-State Methods and Natural Language Processing, 8th International Workshop, FSMNLP 2009, Pretoria, South Africa, July 21-24, 2009, Revised Selected Papers. Lecture Notes in Computer Science 6062, Springer 2010, isbn 978-3-642-14683-1

Gabriele Fici, Elena V. Pribavkina, Jacques Sakarovitch: On the Minimal Uncompletable Word Problem. CoRR abs/1002.1928 (2010)

Jacques Sakarovitch: Elements of Automata Theory. Cambridge University Press 2009, isbn 978-0-521-84425-3, pp. I-XXIV, 1-758

Manfred Droste, Jacques Sakarovitch, Heiko Vogler: Weighted automata with discounting. Inf. Process. Lett. 108(1): 23-28 (2008)

Jacques Sakarovitch: The sequentialisation of automata and transducers (Abstract). AFL 2008: 56-57

Sylvain Lombardy, Jacques Sakarovitch: The universal automaton. Logic and Automata 2008: 457-504

Akim Demaille, Alexandre Duret-Lutz, Florian Lesaint, Sylvain Lombardy, Jacques Sakarovitch, Florent Terrones: An XML Format Proposal for the Description of Weighted Automata, Transducers and Regular Expressions. FSMNLP 2008: 199-206

Jacques Sakarovitch, Rodrigo de Souza: On the Decidability of Bounded Valuedness for Transducers. MFCS 2008: 588-600

Jacques Sakarovitch, Rodrigo de Souza: On the decomposition of k-valued rational relations. STACS 2008: 621-632

Jacques Sakarovitch, Rodrigo de Souza: On the decomposition of k-valued rational relations. CoRR abs/0802.2823 (2008)

Jacques Sakarovitch: Finite Automata and the Writing of Numbers. Developments in Language Theory 2007: 29-30

Sylvain Lombardy, Jacques Sakarovitch: Sequential? Theor. Comput. Sci. 356(1-2): 224-244 (2006)

Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch: Conjugacy and Equivalence of Weighted Automata and Functional Transducers. CSR 2006: 58-69

Sylvain Lombardy, Jacques Sakarovitch: How expressions can code for automata. ITA 39(1): 217-237 (2005)

Sylvain Lombardy, Jacques Sakarovitch: Derivatives of rational expressions with multiplicity. Theor. Comput. Sci. 332(1-3): 141-177 (2005)

Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch: On the Equivalence of -Automata. ICALP 2005: 397-409

Jacques Sakarovitch: The Language, the Expression, and the (Small) Automaton. CIAA 2005: 15-30

Thomas Claveirole, Sylvain Lombardy, Sarah O'Connor, Louis-Noël Pouchet, Jacques Sakarovitch: Inside Vaucanson. CIAA 2005: 116-128

Sylvain Lombardy, Yann Régis-Gianas, Jacques Sakarovitch: Introducing VA_UCANSON. Theor. Comput. Sci. 328(1-2): 77-96 (2004)

Sylvain Lombardy, Jacques Sakarovitch: How Expressions Can Code for Automata. LATIN 2004: 242-251

Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch: Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theor. Comput. Sci. 292(1): 45-63 (2003)

Sylvain Lombardy, Raphaël Poss, Yann Régis-Gianas, Jacques Sakarovitch: Introducing VAUCANSON. CIAA 2003: 96-107

Christiane Frougny, Jacques Sakarovitch: Two Groups Associated with Quadratic Pisot Units. IJAC 12(6): 825-847 (2002)

Sylvain Lombardy, Jacques Sakarovitch: Star Height of Reversible Languages and Universal Automata. LATIN 2002: 76-90

Sylvain Lombardy, Jacques Sakarovitch: Derivation of Rational Expressions with Multiplicity. MFCS 2002: 471-482

Sylvain Lombardy, Jacques Sakarovitch: On the Star Height of Rational Languages: A New Presentation for Two Old Results. Words, Languages & Combinatorics 2000: 266-285

Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch: Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. LATIN 2000: 397-406

Christiane Frougny, Jacques Sakarovitch: Automatic Conversion from Fibonacci Representation to Representation in Base φ, and a Generalization. IJAC 9(3-4): 351-384 (1999)

Maryse Pelletier, Jacques Sakarovitch: On the Representation of Finite Deterministic 2-Tape Automata. Theor. Comput. Sci. 225(1-2): 1-63 (1999)

Christiane Frougny, Jacques Sakarovitch: A Rewrite System Associated with Quadratic Pisot Units. RTA 1999: 356-370

Christiane Frougny, Jacques Sakarovitch: Synchronisation déterministe des automates à délai borné. Theor. Comput. Sci. 191(1-2): 61-77 (1998)

Jacques Sakarovitch: A Construction on Finite Automata that has Remained Hidden. Theor. Comput. Sci. 204(1-2): 205-231 (1998)

Maryse Pelletier, Jacques Sakarovitch: On the Lexicographic Uniformisation of Deterministic 2-Tape Automata (Extended Abstract). IFIP Congress (1) 1994: 485-490

Christiane Frougny, Jacques Sakarovitch: Synchronized Rational Relations of Finite and Infinite Words. Theor. Comput. Sci. 108(1): 45-82 (1993)

Jacques Sakarovitch: The "Last" Decision Problem for Rational Trace Languages. LATIN 1992: 460-473

Christiane Frougny, Jacques Sakarovitch: Rational Ralations with Bounded Delay. STACS 1991: 50-63

Maryse Pelletier, Jacques Sakarovitch: Easy Multiplications II. Extensions of Rational Semigroups. Inf. Comput. 88(1): 18-59 (1990)

Jacques Sakarovitch: Easy Multiplications. I. The Realm of Kleene's Theorem. Inf. Comput. 74(3): 173-197 (1987)

Jacques Sakarovitch: On Regular Trace Languages. Theor. Comput. Sci. 52: 59-75 (1987)

M. Benois, Jacques Sakarovitch: On the Complexity of Some Extended Word Problems Defined by Cancellation Rules. Inf. Process. Lett. 23(6): 281-287 (1986)

Jacques Sakarovitch: Kleene's theorem revisited. IMYCS 1986: 39-50

Jean Berstel, Jacques Sakarovitch: Recent Results in the Theory of Rational Sets. MFCS 1986: 15-28

Fabienne Romian, Jacques Sakarovitch: One-Sided Dyck Reduction Over Two Letter Alphabet and Deterministic Context-Free Languages. MFCS 1986: 554-563

Jean-Eric Pin, Jacques Sakarovitch: Une Application de la Representation Matricielle des Transductions. Theor. Comput. Sci. 35: 271-293 (1985)

Jacques Sakarovitch, Taishin Y. Nishida, Youichi Kobuchi: Recurrent Words for Substitution. Mathematical Systems Theory 17(3): 199-215 (1984)

Jacques Sakarovitch: Deux Remarques sur un Théorème de S. Eilenberg. ITA 17(1): 23-48 (1983)

Jean-Eric Pin, Jacques Sakarovitch: Some operations and transductions that preserve rationality. Theoretical Computer Science 1983: 277-288

Christiane Frougny, Jacques Sakarovitch, Erich Valkema: On the Hotz Group of a Context-Free Grammar. Acta Inf. 18: 109-115 (1982)

Jacques Sakarovitch: Description des monoïdes de type fini. Elektronische Informationsverarbeitung und Kybernetik 17(8/9): 417-434 (1981)

Jacques Sakarovitch: Sur une Propriété d'Itération des Langages Algébriques Déterministes. Mathematical Systems Theory 14: 247-288 (1981)

Jacques Sakarovitch: Syntaxe des langages de Chomsky - essai sur le determinisme. Univ. Paris VII 1979, pp. 1-175

Jacques Sakarovitch: Théorème de transversale rationnelle pour les automates à pile déterministes. Theoretical Computer Science 1979: 276-285

Jean-François Perrot, Jacques Sakarovitch: A Theory of Syntactic Monoids for Context-Free Languages. IFIP Congress 1977: 69-72

Jacques Sakarovitch: Monoides syntactiques et langages algebriques. Univ. Paris VII 1976, pp. I-XV, 1-165

Jacques Sakarovitch: Sur les monoïdes syntactiques des langages algébriques déterministes. ICALP 1976: 52-65

Jacques Sakarovitch: An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group Languages. MFCS 1976: 510-516

Jean-François Perrot, Jacques Sakarovitch: Langages algébriques déterministes et groupes abeliens. Automata Theory and Formal Languages 1975: 20-30