Jacques Sakarovitch

According to our database1, Jacques Sakarovitch
  • authored at least 81 papers between 1975 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
The signature of rational languages.
Theor. Comput. Sci., 2017

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

2016
Trees and Languages with Periodic Signature.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
Automata and rational expressions.
CoRR, 2015

2014
Breadth-first serialisation of trees and rational languages.
CoRR, 2014

Rhythmic generation of infinite trees and languages.
CoRR, 2014

A Type System for Weighted Automata and Rational Expressions.
Proceedings of the Implementation and Application of Automata, 2014

Breadth-First Serialisation of Trees and Rational Languages - (Short Paper).
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013
The Validity of Weighted Automata.
IJAC, 2013

Auto-similarity in rational base number systems
CoRR, 2013

Ultimate periodicity of b-recognisable sets : a quasilinear procedure
CoRR, 2013

Implementation Concepts in Vaucanson 2.
Proceedings of the Implementation and Application of Automata, 2013

Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Auto-similarity in Rational Base Number Systems.
Proceedings of the Combinatorics on Words - 9th International Conference, 2013

On Sets of Numbers Rationally Represented in a Rational Base Number System.
Proceedings of the Algebraic Informatics - 5th International Conference, 2013

2012
On sets of numbers rationally represented in a rational base number system
CoRR, 2012

The Removal of Weighted ε-Transitions.
Proceedings of the Implementation and Application of Automata, 2012

2011
Finite-state methods and models in natural language processing.
Natural Language Engineering, 2011

On the enumerating series of an abstract numeration system
CoRR, 2011

2010
Lexicographic Decomposition of k-Valued Transducers.
Theory Comput. Syst., 2010

On the Number of Broken Derived Terms of a Rational Expression.
Journal of Automata, Languages and Combinatorics, 2010

Corrigendum to our paper: How Expressions Can Code for Automata.
RAIRO - Theor. Inf. and Applic., 2010

Radix enumeration of rational languages.
RAIRO - Theor. Inf. and Applic., 2010

On the Minimal Uncompletable Word Problem
CoRR, 2010

Radix Cross-Sections for Length Morphisms.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009
Elements of Automata Theory.
Cambridge University Press, ISBN: 978-0-521-84425-3, 2009

2008
Weighted automata with discounting.
Inf. Process. Lett., 2008

On the decomposition of k-valued rational relations
CoRR, 2008

On the decomposition of k-valued rational relations.
Proceedings of the STACS 2008, 2008

On the Decidability of Bounded Valuedness for Transducers.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

An XML Format Proposal for the Description of Weighted Automata, Transducers and Regular Expressions.
Proceedings of the Finite-State Methods and Natural Language Processing, 2008

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

The sequentialisation of automata and transducers (Abstract).
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007
Finite Automata and the Writing of Numbers.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006
Sequential?
Theor. Comput. Sci., 2006

Conjugacy and Equivalence of Weighted Automata and Functional Transducers.
Proceedings of the Computer Science, 2006

2005
Derivatives of rational expressions with multiplicity.
Theor. Comput. Sci., 2005

How expressions can code for automata.
ITA, 2005

The Language, the Expression, and the (Small) Automaton.
Proceedings of the Implementation and Application of Automata, 2005

Inside Vaucanson.
Proceedings of the Implementation and Application of Automata, 2005

On the Equivalence of -Automata.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
Introducing VAUCANSON.
Theor. Comput. Sci., 2004

How Expressions Can Code for Automata.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003
The finite power property in free groups.
Theor. Comput. Sci., 2003

Squaring transducers: an efficient procedure for deciding functionality and sequentiality.
Theor. Comput. Sci., 2003

Introducing VAUCANSON.
Proceedings of the Implementation and Application of Automata, 2003

2002
Two Groups Associated with Quadratic Pisot Units.
IJAC, 2002

Derivation of Rational Expressions with Multiplicity.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Star Height of Reversible Languages and Universal Automata.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2000
Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

On the Star Height of Rational Languages: A New Presentation for Two Old Results.
Proceedings of the International Colloquium on Words, 2000

1999
On the Representation of Finite Deterministic 2-Tape Automata.
Theor. Comput. Sci., 1999

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

A Rewrite System Associated with Quadratic Pisot Units.
Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

1998
A Construction on Finite Automata that has Remained Hidden.
Theor. Comput. Sci., 1998

Synchronisation déterministe des automates à délai borné.
Theor. Comput. Sci., 1998

1994
On the Lexicographic Uniformisation of Deterministic 2-Tape Automata (Extended Abstract).
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.
Theor. Comput. Sci., 1993

1992
The "Last" Decision Problem for Rational Trace Languages.
Proceedings of the LATIN '92, 1992

1991
Rational Ralations with Bounded Delay.
Proceedings of the STACS 91, 1991

1990
Easy Multiplications II. Extensions of Rational Semigroups
Inf. Comput., September, 1990

1987
Easy Multiplications. I. The Realm of Kleene's Theorem
Inf. Comput., September, 1987

On Regular Trace Languages.
Theor. Comput. Sci., 1987

1986
On the Complexity of Some Extended Word Problems Defined by Cancellation Rules.
Inf. Process. Lett., 1986

One-Sided Dyck Reduction Over Two Letter Alphabet and Deterministic Context-Free Languages.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

Recent Results in the Theory of Rational Sets.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

Kleene's theorem revisited.
Proceedings of the Trends, 1986

1985
Une Application de la Representation Matricielle des Transductions.
Theor. Comput. Sci., 1985

1984
Recurrent Words for Substitution.
Mathematical Systems Theory, 1984

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

Some operations and transductions that preserve rationality.
Proceedings of the Theoretical Computer Science, 1983

1982
On the Hotz Group of a Context-Free Grammar.
Acta Inf., 1982

1981
Sur une Propriété d'Itération des Langages Algébriques Déterministes.
Mathematical Systems Theory, 1981

Description des monoïdes de type fini.
Elektronische Informationsverarbeitung und Kybernetik, 1981

1979
Théorème de transversale rationnelle pour les automates à pile déterministes.
Proceedings of the Theoretical Computer Science, 1979

Syntaxe des langages de Chomsky - essai sur le determinisme.
PhD thesis, 1979

1977
A Theory of Syntactic Monoids for Context-Free Languages.
IFIP Congress, 1977

1976
An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group Languages.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

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

Monoides syntactiques et langages algebriques.
PhD thesis, 1976

1975
Langages algébriques déterministes et groupes abeliens.
Proceedings of the Automata Theory and Formal Languages, 1975


  Loading...