Jacques Sakarovitch

Publication Activity (10 Years)

Years Active: 1975-2022
Publications (10 Years): 13

Top Venues

CoRR

CIAA

Developments in Language Theory

LATIN

Univ. Paris VII (PHD)

Education History

Univ. Paris VII

PHD

Publications

Sylvain Lombardy, Jacques Sakarovitch
Morphisms and Minimisation of Weighted Automata. Fundam. Informaticae 186 (1-4) (2022)
Sylvain Lombardy, Jacques Sakarovitch
The Net Automaton of a Rational Expression. LATIN (2022)
Sylvain Lombardy, Jacques Sakarovitch
Derived terms without derivation a shifted perspective on the derived-term automaton. CoRR (2021)
Sylvain Lombardy, Jacques Sakarovitch
Morphisms and minimization of weighted automata. CoRR (2021)
Valérie Berthé, Christiane Frougny, Michel Rigo, Jacques Sakarovitch
The carry propagation of the successor function. Adv. Appl. Math. 120 (2020)
Valérie Berthé, Christiane Frougny, Michel Rigo, Jacques Sakarovitch
The carry propagation of the successor function. CoRR (2019)
Sylvain Lombardy, Jacques Sakarovitch
The Validity of Weighted Automata. CIAA (2018)
Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch
On subtrees of the representation tree in rational base numeration systems. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Sylvain Lombardy, Jacques Sakarovitch
Two Routes to Automata Minimization and the Ways to Reach It Efficiently. CIAA (2018)
Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch
On subtrees of the representation tree in rational base numeration systems. CoRR (2017)
Victor Marsault, Jacques Sakarovitch
The signature of rational languages. Theor. Comput. Sci. 658 (2017)
Victor Marsault, Jacques Sakarovitch
Trees and Languages with Periodic Signature. LATIN (2016)
Jacques Sakarovitch
Automata and rational expressions. CoRR (2015)
Victor Marsault, Jacques Sakarovitch
Rhythmic generation of infinite trees and languages. CoRR (2014)
Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Luca Saiu, Jacques Sakarovitch
A Type System for Weighted Automata and Rational Expressions. CIAA (2014)
Victor Marsault, Jacques Sakarovitch
Breadth-first serialisation of trees and rational languages. CoRR (2014)
Victor Marsault, Jacques Sakarovitch
Breadth-First Serialisation of Trees and Rational Languages - (Short Paper). Developments in Language Theory (2014)
Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Jacques Sakarovitch
Implementation Concepts in Vaucanson 2. CIAA (2013)
Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch
Auto-similarity in Rational Base Number Systems. WORDS (2013)
Victor Marsault, Jacques Sakarovitch
Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure. Developments in Language Theory (2013)
Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch
Auto-similarity in rational base number systems CoRR (2013)
Sylvain Lombardy, Jacques Sakarovitch
The Validity of Weighted Automata. Int. J. Algebra Comput. 23 (4) (2013)
Victor Marsault, Jacques Sakarovitch
Ultimate periodicity of b-recognisable sets : a quasilinear procedure CoRR (2013)
Victor Marsault, Jacques Sakarovitch
On Sets of Numbers Rationally Represented in a Rational Base Number System. CAI (2013)
Victor Marsault, Jacques Sakarovitch
On sets of numbers rationally represented in a rational base number system CoRR (2012)
Sylvain Lombardy, Jacques Sakarovitch
The Removal of Weighted ε-Transitions. CIAA (2012)
Anssi Yli-Jyrä, András Kornai, Jacques Sakarovitch
Finite-state methods and models in natural language processing. Nat. Lang. Eng. 17 (2) (2011)
Pierre-Yves Angrand, Jacques Sakarovitch
On the enumerating series of an abstract numeration system CoRR (2011)
Gabriele Fici, Elena V. Pribavkina, Jacques Sakarovitch
On the Minimal Uncompletable Word Problem CoRR (2010)
Sylvain Lombardy, Jacques Sakarovitch
Corrigendum to our paper: How Expressions Can Code for Automata. RAIRO Theor. Informatics Appl. 44 (3) (2010)
Pierre-Yves Angrand, Sylvain Lombardy, Jacques Sakarovitch
On the Number of Broken Derived Terms of a Rational Expression. J. Autom. Lang. Comb. 15 (1/2) (2010)
Jacques Sakarovitch, Rodrigo de Souza
-Valued Transducers. Theory Comput. Syst. 47 (3) (2010)
Sylvain Lombardy, Jacques Sakarovitch
Radix Cross-Sections for Length Morphisms. LATIN (2010)
Pierre-Yves Angrand, Jacques Sakarovitch
Radix enumeration of rational languages. RAIRO Theor. Informatics Appl. 44 (1) (2010)
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)
Jacques Sakarovitch
The sequentialisation of automata and transducers (Abstract). AFL (2008)
Jacques Sakarovitch, Rodrigo de Souza
On the decomposition of k-valued rational relations CoRR (2008)
Jacques Sakarovitch, Rodrigo de Souza
On the Decidability of Bounded Valuedness for Transducers. MFCS (2008)
Manfred Droste, Jacques Sakarovitch, Heiko Vogler
Weighted automata with discounting. Inf. Process. Lett. 108 (1) (2008)
Jacques Sakarovitch, Rodrigo de Souza
On the decomposition of k-valued rational relations. STACS (2008)
Sylvain Lombardy, Jacques Sakarovitch
The universal automaton. Logic and Automata (2008)
Jacques Sakarovitch
Finite Automata and the Writing of Numbers. Developments in Language Theory (2007)
Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch
Conjugacy and Equivalence of Weighted Automata and Functional Transducers. CSR (2006)
Sylvain Lombardy, Jacques Sakarovitch
Sequential? Theor. Comput. Sci. 356 (1-2) (2006)
Thomas Claveirole, Sylvain Lombardy, Sarah O'Connor, Louis-Noël Pouchet, Jacques Sakarovitch
Inside Vaucanson. CIAA (2005)
Sylvain Lombardy, Jacques Sakarovitch
How expressions can code for automata. RAIRO Theor. Informatics Appl. 39 (1) (2005)
Jacques Sakarovitch
The Language, the Expression, and the (Small) Automaton. CIAA (2005)
Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch
On the Equivalence of -Automata. ICALP (2005)
Sylvain Lombardy, Jacques Sakarovitch
Derivatives of rational expressions with multiplicity. Theor. Comput. Sci. 332 (1-3) (2005)
Sylvain Lombardy, Yann Régis-Gianas, Jacques Sakarovitch
. Theor. Comput. Sci. 328 (1-2) (2004)
Sylvain Lombardy, Jacques Sakarovitch
How Expressions Can Code for Automata. LATIN (2004)
Flavio D'Alessandro, Jacques Sakarovitch
The finite power property in free groups. Theor. Comput. Sci. 293 (1) (2003)
Sylvain Lombardy, Raphael Poss, Yann Régis-Gianas, Jacques Sakarovitch
Introducing VAUCANSON. CIAA (2003)
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) (2003)
Christiane Frougny, Jacques Sakarovitch
Two Groups Associated with Quadratic Pisot Units. Int. J. Algebra Comput. 12 (6) (2002)
Sylvain Lombardy, Jacques Sakarovitch
Derivation of Rational Expressions with Multiplicity. MFCS (2002)
Sylvain Lombardy, Jacques Sakarovitch
Star Height of Reversible Languages and Universal Automata. LATIN (2002)
Sylvain Lombardy, Jacques Sakarovitch
On the Star Height of Rational Languages: A New Presentation for Two Old Results. Words, Languages & Combinatorics (2000)
Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch
Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. LATIN (2000)
Christiane Frougny, Jacques Sakarovitch
Automatic Conversion from Fibonacci Representation to Representation in Base φ, and a Generalization. Int. J. Algebra Comput. 9 (3-4) (1999)
Maryse Pelletier, Jacques Sakarovitch
On the Representation of Finite Deterministic 2-Tape Automata. Theor. Comput. Sci. 225 (1-2) (1999)
Christiane Frougny, Jacques Sakarovitch
A Rewrite System Associated with Quadratic Pisot Units. RTA (1999)
Jacques Sakarovitch
A Construction on Finite Automata that has Remained Hidden. Theor. Comput. Sci. 204 (1-2) (1998)
Christiane Frougny, Jacques Sakarovitch
Synchronisation déterministe des automates à délai borné. Theor. Comput. Sci. 191 (1-2) (1998)
Maryse Pelletier, Jacques Sakarovitch
On the Lexicographic Uniformisation of Deterministic 2-Tape Automata (Extended Abstract). IFIP Congress (1) (1994)
Christiane Frougny, Jacques Sakarovitch
Synchronized Rational Relations of Finite and Infinite Words. Theor. Comput. Sci. 108 (1) (1993)
Jacques Sakarovitch
The "Last" Decision Problem for Rational Trace Languages. LATIN (1992)
Christiane Frougny, Jacques Sakarovitch
Rational Ralations with Bounded Delay. STACS (1991)
Maryse Pelletier, Jacques Sakarovitch
Easy Multiplications II. Extensions of Rational Semigroups Inf. Comput. 88 (1) (1990)
Jacques Sakarovitch
Easy Multiplications. I. The Realm of Kleene's Theorem Inf. Comput. 74 (3) (1987)
Jacques Sakarovitch
On Regular Trace Languages. Theor. Comput. Sci. 52 (1987)
Jean Berstel, Jacques Sakarovitch
Recent Results in the Theory of Rational Sets. MFCS (1986)
Fabienne Romian, Jacques Sakarovitch
One-Sided Dyck Reduction Over Two Letter Alphabet and Deterministic Context-Free Languages. MFCS (1986)
Jacques Sakarovitch
Kleene's theorem revisited. IMYCS (1986)
M. Benois, Jacques Sakarovitch
On the Complexity of Some Extended Word Problems Defined by Cancellation Rules. Inf. Process. Lett. 23 (6) (1986)
Jean-Eric Pin, Jacques Sakarovitch
Une Application de la Representation Matricielle des Transductions. Theor. Comput. Sci. 35 (1985)
Jacques Sakarovitch, Taishin Y. Nishida, Youichi Kobuchi
Recurrent Words for Substitution. Math. Syst. Theory 17 (3) (1984)
Jacques Sakarovitch
Deux Remarques sur un Théorème de S. Eilenberg. RAIRO Theor. Informatics Appl. 17 (1) (1983)
Jean-Eric Pin, Jacques Sakarovitch
Some operations and transductions that preserve rationality. Theoretical Computer Science (1983)
Christiane Frougny, Jacques Sakarovitch, Erich Valkema
On the Hotz Group of a Context-Free Grammar. Acta Informatica 18 (1982)
Jacques Sakarovitch
Description des monoïdes de type fini. J. Inf. Process. Cybern. 17 (8/9) (1981)
Jacques Sakarovitch
Sur une Propriété d'Itération des Langages Algébriques Déterministes. Math. Syst. Theory 14 (1981)
Jacques Sakarovitch
Théorème de transversale rationnelle pour les automates à pile déterministes. Theoretical Computer Science (1979)
Jean-François Perrot, Jacques Sakarovitch
A Theory of Syntactic Monoids for Context-Free Languages. IFIP Congress (1977)
Jacques Sakarovitch
An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group Languages. MFCS (1976)
Jacques Sakarovitch
Sur les monoïdes syntactiques des langages algébriques déterministes. ICALP (1976)
Jean-François Perrot, Jacques Sakarovitch
Langages algébriques déterministes et groupes abeliens. Automata Theory and Formal Languages (1975)

Jacques Sakarovitch.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jacques Sakarovitch