Jacques Sakarovitch

According to our database, Jacques Sakarovitch authored at least 83 papers between 1975 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Morphisms and Minimisation of Weighted Automata.

Sylvain Lombardy, Jacques Sakarovitch

Fundam. Informaticae, 2022

The Net Automaton of a Rational Expression.

Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

Morphisms and minimization of weighted automata.

Sylvain Lombardy, Jacques Sakarovitch

CoRR, 2021

Derived terms without derivation a shifted perspective on the derived-term automaton.

Sylvain Lombardy, Jacques Sakarovitch

CoRR, 2021

Automata and rational expressions.

Jacques Sakarovitch

Proceedings of the Handbook of Automata Theory., 2021

2020

The carry propagation of the successor function.

Valérie Berthé, Christiane Frougny, Michel Rigo, Jacques Sakarovitch

Adv. Appl. Math., 2020

2018

On subtrees of the representation tree in rational base numeration systems.

Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch

Discret. Math. Theor. Comput. Sci., 2018

Two Routes to Automata Minimization and the Ways to Reach It Efficiently.

Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the Implementation and Application of Automata, 2018

2017

The signature of rational languages.

Victor Marsault, Jacques Sakarovitch

Theor. Comput. Sci., 2017

2016

Trees and Languages with Periodic Signature.

Victor Marsault, Jacques Sakarovitch

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

Automata and rational expressions.

Jacques Sakarovitch

CoRR, 2015

2014

Breadth-first serialisation of trees and rational languages.

Victor Marsault, Jacques Sakarovitch

CoRR, 2014

Rhythmic generation of infinite trees and languages.

Victor Marsault, Jacques Sakarovitch

CoRR, 2014

A Type System for Weighted Automata and Rational Expressions.

Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Luca Saiu, Jacques Sakarovitch

Proceedings of the Implementation and Application of Automata, 2014

Breadth-First Serialisation of Trees and Rational Languages - (Short Paper).

Victor Marsault, Jacques Sakarovitch

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013

The Validity of Weighted Automata.

Sylvain Lombardy, Jacques Sakarovitch

Int. J. Algebra Comput., 2013

Implementation Concepts in Vaucanson 2.

Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the Implementation and Application of Automata, 2013

Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure.

Victor Marsault, Jacques Sakarovitch

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Auto-similarity in Rational Base Number Systems.

Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

On Sets of Numbers Rationally Represented in a Rational Base Number System.

Victor Marsault, Jacques Sakarovitch

Proceedings of the Algebraic Informatics - 5th International Conference, 2013

2012

The Removal of Weighted ε-Transitions.

Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the Implementation and Application of Automata, 2012

2011

Finite-state methods and models in natural language processing.

Anssi Yli-Jyrä, András Kornai, Jacques Sakarovitch

Nat. Lang. Eng., 2011

On the enumerating series of an abstract numeration system

Pierre-Yves Angrand, Jacques Sakarovitch

CoRR, 2011

2010

Lexicographic Decomposition of <i>k</i>-Valued Transducers.

Jacques Sakarovitch, Rodrigo de Souza

Theory Comput. Syst., 2010

On the Number of Broken Derived Terms of a Rational Expression.

Pierre-Yves Angrand, Sylvain Lombardy, Jacques Sakarovitch

J. Autom. Lang. Comb., 2010

Corrigendum to our paper: How Expressions Can Code for Automata.

Sylvain Lombardy, Jacques Sakarovitch

RAIRO Theor. Informatics Appl., 2010

Radix enumeration of rational languages.

Pierre-Yves Angrand, Jacques Sakarovitch

RAIRO Theor. Informatics Appl., 2010

On the Minimal Uncompletable Word Problem

Gabriele Fici, Elena V. Pribavkina, Jacques Sakarovitch

CoRR, 2010

Radix Cross-Sections for Length Morphisms.

Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Elements of Automata Theory.

Jacques Sakarovitch

Cambridge University Press, ISBN: 978-0-521-84425-3, 2009

2008

Weighted automata with discounting.

Manfred Droste, Jacques Sakarovitch, Heiko Vogler

Inf. Process. Lett., 2008

On the decomposition of k-valued rational relations.

Jacques Sakarovitch, Rodrigo de Souza

Proceedings of the STACS 2008, 2008

On the Decidability of Bounded Valuedness for Transducers.

Jacques Sakarovitch, Rodrigo de Souza

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

An XML Format Proposal for the Description of Weighted Automata, Transducers and Regular Expressions.

Akim Demaille, Alexandre Duret-Lutz, Florian Lesaint, Sylvain Lombardy, Jacques Sakarovitch, Florent Terrones

Proceedings of the Finite-State Methods and Natural Language Processing, 2008

The universal automaton.

Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

The sequentialisation of automata and transducers (Abstract).

Jacques Sakarovitch

Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007

Finite Automata and the Writing of Numbers.

Jacques Sakarovitch

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006

Sequential?

Sylvain Lombardy, Jacques Sakarovitch

Theor. Comput. Sci., 2006

Conjugacy and Equivalence of Weighted Automata and Functional Transducers.

Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the Computer Science, 2006

2005

Derivatives of rational expressions with multiplicity.

Sylvain Lombardy, Jacques Sakarovitch

Theor. Comput. Sci., 2005

How expressions can code for automata.

Sylvain Lombardy, Jacques Sakarovitch

RAIRO Theor. Informatics Appl., 2005

The Language, the Expression, and the (Small) Automaton.

Jacques Sakarovitch

Proceedings of the Implementation and Application of Automata, 2005

Inside Vaucanson.

Thomas Claveirole, Sylvain Lombardy, Sarah O'Connor, Louis-Noël Pouchet, Jacques Sakarovitch

Proceedings of the Implementation and Application of Automata, 2005

On the Equivalence of -Automata.

Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Introducing VA_UCANSON.

Sylvain Lombardy, Yann Régis-Gianas, Jacques Sakarovitch

Theor. Comput. Sci., 2004

2003

The finite power property in free groups.

Flavio D'Alessandro, Jacques Sakarovitch

Theor. Comput. Sci., 2003

Squaring transducers: an efficient procedure for deciding functionality and sequentiality.

Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch

Theor. Comput. Sci., 2003

Introducing VAUCANSON.

Sylvain Lombardy, Raphael Poss, Yann Régis-Gianas, Jacques Sakarovitch

Proceedings of the Implementation and Application of Automata, 2003

2002

Two Groups Associated with Quadratic Pisot Units.

Christiane Frougny, Jacques Sakarovitch

Int. J. Algebra Comput., 2002

Derivation of Rational Expressions with Multiplicity.

Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Star Height of Reversible Languages and Universal Automata.

Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2000

Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers.

Marie-Pierre Béal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

On the Star Height of Rational Languages: A New Presentation for Two Old Results.

Sylvain Lombardy, Jacques Sakarovitch

Proceedings of the International Colloquium on Words, 2000

1999

On the Representation of Finite Deterministic 2-Tape Automata.

Maryse Pelletier, Jacques Sakarovitch

Theor. Comput. Sci., 1999

Automatic Conversion from Fibonacci Representation to Representation in Base φ, and a Generalization.

Christiane Frougny, Jacques Sakarovitch

Int. J. Algebra Comput., 1999

A Rewrite System Associated with Quadratic Pisot Units.

Christiane Frougny, Jacques Sakarovitch

Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

1998

A Construction on Finite Automata that has Remained Hidden.

Jacques Sakarovitch

Theor. Comput. Sci., 1998

Synchronisation déterministe des automates à délai borné.

Christiane Frougny, Jacques Sakarovitch

Theor. Comput. Sci., 1998

1994

On the Lexicographic Uniformisation of Deterministic 2-Tape Automata (Extended Abstract).

Maryse Pelletier, Jacques Sakarovitch

Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1993

Synchronized Rational Relations of Finite and Infinite Words.

Christiane Frougny, Jacques Sakarovitch

Theor. Comput. Sci., 1993

1992

The "Last" Decision Problem for Rational Trace Languages.

Jacques Sakarovitch

Proceedings of the LATIN '92, 1992

1991

Rational Ralations with Bounded Delay.

Christiane Frougny, Jacques Sakarovitch

Proceedings of the STACS 91, 1991

1990

Easy Multiplications II. Extensions of Rational Semigroups

Maryse Pelletier, Jacques Sakarovitch

Inf. Comput., September, 1990

1987

Easy Multiplications. I. The Realm of Kleene's Theorem

Jacques Sakarovitch

Inf. Comput., September, 1987

On Regular Trace Languages.

Jacques Sakarovitch

Theor. Comput. Sci., 1987

1986

On the Complexity of Some Extended Word Problems Defined by Cancellation Rules.

M. Benois, Jacques Sakarovitch

Inf. Process. Lett., 1986

One-Sided Dyck Reduction Over Two Letter Alphabet and Deterministic Context-Free Languages.

Fabienne Romian, Jacques Sakarovitch

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

Recent Results in the Theory of Rational Sets.

Jean Berstel, Jacques Sakarovitch

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

Kleene's theorem revisited.

Jacques Sakarovitch

Proceedings of the Trends, 1986

1985

Une Application de la Representation Matricielle des Transductions.

Jean-Eric Pin, Jacques Sakarovitch

Theor. Comput. Sci., 1985

1984

Recurrent Words for Substitution.

Jacques Sakarovitch, Taishin Y. Nishida, Youichi Kobuchi

Math. Syst. Theory, 1984

1983

Deux Remarques sur un Théorème de S. Eilenberg.

Jacques Sakarovitch

RAIRO Theor. Informatics Appl., 1983

Some operations and transductions that preserve rationality.

Jean-Eric Pin, Jacques Sakarovitch

Proceedings of the Theoretical Computer Science, 1983

1982

On the Hotz Group of a Context-Free Grammar.

Christiane Frougny, Jacques Sakarovitch, Erich Valkema

Acta Informatica, 1982

1981

Sur une Propriété d'Itération des Langages Algébriques Déterministes.

Jacques Sakarovitch

Math. Syst. Theory, 1981

Description des monoïdes de type fini.

Jacques Sakarovitch

J. Inf. Process. Cybern., 1981

1979

Théorème de transversale rationnelle pour les automates à pile déterministes.

Jacques Sakarovitch

Proceedings of the Theoretical Computer Science, 1979

Syntaxe des langages de Chomsky - essai sur le determinisme.

Jacques Sakarovitch

PhD thesis, 1979

1977

A Theory of Syntactic Monoids for Context-Free Languages.

Jean-François Perrot, Jacques Sakarovitch

Proceedings of the Information Processing, 1977

1976

An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group Languages.

Jacques Sakarovitch

Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

Sur les monoïdes syntactiques des langages algébriques déterministes.

Jacques Sakarovitch

Proceedings of the Third International Colloquium on Automata, 1976

Monoides syntactiques et langages algebriques.

Jacques Sakarovitch

PhD thesis, 1976

1975

Langages algébriques déterministes et groupes abeliens.

Jean-François Perrot, Jacques Sakarovitch

Proceedings of the Automata Theory and Formal Languages, 1975