Jacques Sakarovitch

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