default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacques Sakarovitch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j33]Sylvain Lombardy, Jacques Sakarovitch:
Morphisms and Minimisation of Weighted Automata. Fundam. Informaticae 186(1-4): 195-218 (2022)- [c41]Sylvain Lombardy, Jacques Sakarovitch:
The Net Automaton of a Rational Expression. LATIN 2022: 376-392 - 2021
- [p1]Jacques Sakarovitch:
Automata and rational expressions. Handbook of Automata Theory (I.) 2021: 39-78 - [i13]Sylvain Lombardy, Jacques Sakarovitch:
Derived terms without derivation a shifted perspective on the derived-term automaton. CoRR abs/2110.09181 (2021) - [i12]Sylvain Lombardy, Jacques Sakarovitch:
Morphisms and minimization of weighted automata. CoRR abs/2112.09387 (2021) - 2020
- [j32]Valérie Berthé
, Christiane Frougny, Michel Rigo, Jacques Sakarovitch:
The carry propagation of the successor function. Adv. Appl. Math. 120: 102062 (2020)
2010 – 2019
- 2019
- [i11]Valérie Berthé, Christiane Frougny, Michel Rigo, Jacques Sakarovitch:
The carry propagation of the successor function. CoRR abs/1907.01464 (2019) - 2018
- [j31]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) - [c40]Sylvain Lombardy, Jacques Sakarovitch:
The Validity of Weighted Automata. CIAA 2018: 41-45 - [c39]Sylvain Lombardy, Jacques Sakarovitch:
Two Routes to Automata Minimization and the Ways to Reach It Efficiently. CIAA 2018: 248-260 - 2017
- [j30]Victor Marsault, Jacques Sakarovitch:
The signature of rational languages. Theor. Comput. Sci. 658: 216-234 (2017) - [i10]Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch:
On subtrees of the representation tree in rational base numeration systems. CoRR abs/1706.08266 (2017) - 2016
- [c38]Victor Marsault, Jacques Sakarovitch:
Trees and Languages with Periodic Signature. LATIN 2016: 605-618 - 2015
- [i9]Jacques Sakarovitch:
Automata and rational expressions. CoRR abs/1502.03573 (2015) - 2014
- [c37]Victor Marsault, Jacques Sakarovitch:
Breadth-First Serialisation of Trees and Rational Languages - (Short Paper). Developments in Language Theory 2014: 252-259 - [c36]Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Luca Saiu, Jacques Sakarovitch:
A Type System for Weighted Automata and Rational Expressions. CIAA 2014: 162-175 - [i8]Victor Marsault, Jacques Sakarovitch:
Rhythmic generation of infinite trees and languages. CoRR abs/1403.5190 (2014) - [i7]Victor Marsault, Jacques Sakarovitch:
Breadth-first serialisation of trees and rational languages. CoRR abs/1404.0798 (2014) - 2013
- [j29]Sylvain Lombardy, Jacques Sakarovitch:
The Validity of Weighted Automata. Int. J. Algebra Comput. 23(4): 863-914 (2013) - [c35]Victor Marsault, Jacques Sakarovitch:
On Sets of Numbers Rationally Represented in a Rational Base Number System. CAI 2013: 89-100 - [c34]Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch:
Auto-similarity in Rational Base Number Systems. WORDS 2013: 34-45 - [c33]Victor Marsault, Jacques Sakarovitch:
Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure. Developments in Language Theory 2013: 362-373 - [c32]Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Jacques Sakarovitch:
Implementation Concepts in Vaucanson 2. CIAA 2013: 122-133 - [i6]Victor Marsault, Jacques Sakarovitch:
Ultimate periodicity of b-recognisable sets : a quasilinear procedure. CoRR abs/1301.2691 (2013) - [i5]Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch:
Auto-similarity in rational base number systems. CoRR abs/1305.6757 (2013) - 2012
- [c31]Sylvain Lombardy, Jacques Sakarovitch:
The Removal of Weighted ε-Transitions. CIAA 2012: 345-352 - [i4]Victor Marsault, Jacques Sakarovitch:
On sets of numbers rationally represented in a rational base number system. CoRR abs/1208.5412 (2012) - 2011
- [j28]Anssi Yli-Jyrä, András Kornai, Jacques Sakarovitch:
Finite-state methods and models in natural language processing. Nat. Lang. Eng. 17(2): 141-144 (2011) - [i3]Pierre-Yves Angrand, Jacques Sakarovitch:
On the enumerating series of an abstract numeration system. CoRR abs/1108.5711 (2011) - 2010
- [j27]Pierre-Yves Angrand, Jacques Sakarovitch:
Radix enumeration of rational languages. RAIRO Theor. Informatics Appl. 44(1): 19-36 (2010) - [j26]Sylvain Lombardy, Jacques Sakarovitch:
Corrigendum to our paper: How Expressions Can Code for Automata. RAIRO Theor. Informatics Appl. 44(3): 339-361 (2010) - [j25]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): 27-51 (2010) - [j24]Jacques Sakarovitch, Rodrigo de Souza:
Lexicographic Decomposition of k-Valued Transducers. Theory Comput. Syst. 47(3): 758-785 (2010) - [c30]Sylvain Lombardy, Jacques Sakarovitch:
Radix Cross-Sections for Length Morphisms. LATIN 2010: 184-195 - [e1]Anssi Yli-Jyrä, András Kornai, Jacques Sakarovitch, Bruce W. Watson:
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 [contents] - [i2]Gabriele Fici, Elena V. Pribavkina, Jacques Sakarovitch:
On the Minimal Uncompletable Word Problem. CoRR abs/1002.1928 (2010)
2000 – 2009
- 2009
- [b3]Jacques Sakarovitch:
Elements of Automata Theory. Cambridge University Press 2009, ISBN 978-0-521-84425-3, pp. I-XXIV, 1-758 - 2008
- [j23]Manfred Droste, Jacques Sakarovitch, Heiko Vogler:
Weighted automata with discounting. Inf. Process. Lett. 108(1): 23-28 (2008) - [c29]Jacques Sakarovitch:
The sequentialisation of automata and transducers (Abstract). AFL 2008: 56-57 - [c28]Sylvain Lombardy, Jacques Sakarovitch:
The universal automaton. Logic and Automata 2008: 457-504 - [c27]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 - [c26]Jacques Sakarovitch, Rodrigo de Souza:
On the Decidability of Bounded Valuedness for Transducers. MFCS 2008: 588-600 - [c25]Jacques Sakarovitch, Rodrigo de Souza:
On the decomposition of k-valued rational relations. STACS 2008: 621-632 - [i1]Jacques Sakarovitch, Rodrigo de Souza:
On the decomposition of k-valued rational relations. CoRR abs/0802.2823 (2008) - 2007
- [c24]Jacques Sakarovitch:
Finite Automata and the Writing of Numbers. Developments in Language Theory 2007: 29-30 - 2006
- [j22]Sylvain Lombardy, Jacques Sakarovitch:
Sequential? Theor. Comput. Sci. 356(1-2): 224-244 (2006) - [c23]Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch:
Conjugacy and Equivalence of Weighted Automata and Functional Transducers. CSR 2006: 58-69 - 2005
- [j21]Sylvain Lombardy, Jacques Sakarovitch:
How expressions can code for automata. RAIRO Theor. Informatics Appl. 39(1): 217-237 (2005) - [j20]Sylvain Lombardy, Jacques Sakarovitch:
Derivatives of rational expressions with multiplicity. Theor. Comput. Sci. 332(1-3): 141-177 (2005) - [c22]Marie-Pierre Béal, Sylvain Lombardy, Jacques Sakarovitch:
On the Equivalence of -Automata. ICALP 2005: 397-409 - [c21]Jacques Sakarovitch:
The Language, the Expression, and the (Small) Automaton. CIAA 2005: 15-30 - [c20]Thomas Claveirole, Sylvain Lombardy, Sarah O'Connor, Louis-Noël Pouchet, Jacques Sakarovitch:
Inside Vaucanson. CIAA 2005: 116-128 - 2004
- [j19]Sylvain Lombardy, Yann Régis-Gianas, Jacques Sakarovitch:
Introducing VAUCANSON. Theor. Comput. Sci. 328(1-2): 77-96 (2004) - [c19]Sylvain Lombardy, Jacques Sakarovitch:
How Expressions Can Code for Automata. LATIN 2004: 242-251 - 2003
- [j18]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) - [j17]Flavio D'Alessandro, Jacques Sakarovitch:
The finite power property in free groups. Theor. Comput. Sci. 293(1): 55-82 (2003) - [c18]Sylvain Lombardy, Raphael Poss, Yann Régis-Gianas, Jacques Sakarovitch:
Introducing VAUCANSON. CIAA 2003: 96-107 - 2002
- [j16]Christiane Frougny, Jacques Sakarovitch:
Two Groups Associated with Quadratic Pisot Units. Int. J. Algebra Comput. 12(6): 825-847 (2002) - [c17]Sylvain Lombardy, Jacques Sakarovitch:
Star Height of Reversible Languages and Universal Automata. LATIN 2002: 76-90 - [c16]Sylvain Lombardy, Jacques Sakarovitch:
Derivation of Rational Expressions with Multiplicity. MFCS 2002: 471-482 - 2000
- [c15]Sylvain Lombardy, Jacques Sakarovitch:
On the Star Height of Rational Languages: A New Presentation for Two Old Results. Words, Languages & Combinatorics 2000: 266-285 - [c14]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
1990 – 1999
- 1999
- [j15]Christiane Frougny, Jacques Sakarovitch:
Automatic Conversion from Fibonacci Representation to Representation in Base φ, and a Generalization. Int. J. Algebra Comput. 9(3-4): 351-384 (1999) - [j14]Maryse Pelletier, Jacques Sakarovitch:
On the Representation of Finite Deterministic 2-Tape Automata. Theor. Comput. Sci. 225(1-2): 1-63 (1999) - [c13]Christiane Frougny, Jacques Sakarovitch:
A Rewrite System Associated with Quadratic Pisot Units. RTA 1999: 356-370 - 1998
- [j13]Christiane Frougny, Jacques Sakarovitch:
Synchronisation déterministe des automates à délai borné. Theor. Comput. Sci. 191(1-2): 61-77 (1998) - [j12]Jacques Sakarovitch:
A Construction on Finite Automata that has Remained Hidden. Theor. Comput. Sci. 204(1-2): 205-231 (1998) - 1994
- [c12]Maryse Pelletier, Jacques Sakarovitch:
On the Lexicographic Uniformisation of Deterministic 2-Tape Automata (Extended Abstract). IFIP Congress (1) 1994: 485-490 - 1993
- [j11]Christiane Frougny, Jacques Sakarovitch:
Synchronized Rational Relations of Finite and Infinite Words. Theor. Comput. Sci. 108(1): 45-82 (1993) - 1992
- [c11]Jacques Sakarovitch:
The "Last" Decision Problem for Rational Trace Languages. LATIN 1992: 460-473 - 1991
- [c10]Christiane Frougny, Jacques Sakarovitch:
Rational Ralations with Bounded Delay. STACS 1991: 50-63 - 1990
- [j10]Maryse Pelletier, Jacques Sakarovitch:
Easy Multiplications II. Extensions of Rational Semigroups. Inf. Comput. 88(1): 18-59 (1990)
1980 – 1989
- 1987
- [j9]Jacques Sakarovitch:
Easy Multiplications. I. The Realm of Kleene's Theorem. Inf. Comput. 74(3): 173-197 (1987) - [j8]Jacques Sakarovitch:
On Regular Trace Languages. Theor. Comput. Sci. 52: 59-75 (1987) - 1986
- [j7]M. Benois, Jacques Sakarovitch:
On the Complexity of Some Extended Word Problems Defined by Cancellation Rules. Inf. Process. Lett. 23(6): 281-287 (1986) - [c9]Jacques Sakarovitch:
Kleene's theorem revisited. IMYCS 1986: 39-50 - [c8]Jean Berstel, Jacques Sakarovitch:
Recent Results in the Theory of Rational Sets. MFCS 1986: 15-28 - [c7]Fabienne Romian, Jacques Sakarovitch:
One-Sided Dyck Reduction Over Two Letter Alphabet and Deterministic Context-Free Languages. MFCS 1986: 554-563 - 1985
- [j6]Jean-Eric Pin, Jacques Sakarovitch:
Une Application de la Representation Matricielle des Transductions. Theor. Comput. Sci. 35: 271-293 (1985) - 1984
- [j5]Jacques Sakarovitch, Taishin Y. Nishida, Youichi Kobuchi:
Recurrent Words for Substitution. Math. Syst. Theory 17(3): 199-215 (1984) - 1983
- [j4]Jacques Sakarovitch:
Deux Remarques sur un Théorème de S. Eilenberg. RAIRO Theor. Informatics Appl. 17(1): 23-48 (1983) - [c6]Jean-Eric Pin, Jacques Sakarovitch:
Some operations and transductions that preserve rationality. Theoretical Computer Science 1983: 277-288 - 1982
- [j3]Christiane Frougny, Jacques Sakarovitch, Erich Valkema:
On the Hotz Group of a Context-Free Grammar. Acta Informatica 18: 109-115 (1982) - 1981
- [j2]Jacques Sakarovitch:
Description des monoïdes de type fini. J. Inf. Process. Cybern. 17(8/9): 417-434 (1981) - [j1]Jacques Sakarovitch:
Sur une Propriété d'Itération des Langages Algébriques Déterministes. Math. Syst. Theory 14: 247-288 (1981)
1970 – 1979
- 1979
- [b2]Jacques Sakarovitch:
Syntaxe des langages de Chomsky - essai sur le determinisme. Univ. Paris VII, 1979, pp. 1-175 - [c5]Jacques Sakarovitch:
Théorème de transversale rationnelle pour les automates à pile déterministes. Theoretical Computer Science 1979: 276-285 - 1977
- [c4]Jean-François Perrot, Jacques Sakarovitch:
A Theory of Syntactic Monoids for Context-Free Languages. IFIP Congress 1977: 69-72 - 1976
- [b1]Jacques Sakarovitch:
Monoides syntactiques et langages algebriques. Univ. Paris VII, 1976, pp. I-XV, 1-165 - [c3]Jacques Sakarovitch:
Sur les monoïdes syntactiques des langages algébriques déterministes. ICALP 1976: 52-65 - [c2]Jacques Sakarovitch:
An Algebraic Framework for the Study of the Syntactic Monoids Application to the Group Languages. MFCS 1976: 510-516 - 1975
- [c1]Jean-François Perrot, Jacques Sakarovitch:
Langages algébriques déterministes et groupes abeliens. Automata Theory and Formal Languages 1975: 20-30
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
