default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean Berstel
Person information
- affiliation: University Paris-Est Marne-la-Vallée, France
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[p4]Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot:
Minimisation of automata. Handbook of Automata Theory (I.) 2021: 337-373- [p3]Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin:
Symbolic dynamics. Handbook of Automata Theory (II.) 2021: 987-1030
2010 – 2019
- 2013
- [j44]Jean Berstel:
Lettre à Christophe Reutenauer. Int. J. Algebra Comput. 23(4) (2013) - 2012
- [j43]Jean Berstel, Clelia de Felice
, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Recent results on syntactic groups of prefix codes. Eur. J. Comb. 33(7): 1386-1401 (2012) - [j42]Jean Berstel, Luc Boasson, Isabelle Fagnot:
Splicing systems and the Chomsky hierarchy. Theor. Comput. Sci. 436: 2-22 (2012) - 2011
- [i6]Jean Berstel, Luc Boasson, Isabelle Fagnot:
Splicing systems and the Chomsky hierarchy. CoRR abs/1102.0947 (2011) - 2010
- [b4]Jean Berstel, Dominique Perrin, Christophe Reutenauer:
Codes and Automata. Encyclopedia of mathematics and its applications 129, Cambridge University Press 2010, ISBN 978-0-521-88831-8, pp. I-XIII, 1-619 - [j41]Jean Berstel, Luc Boasson, Olivier Carton, Jean-Eric Pin, Antonio Restivo:
The expressive power of the shuffle product. Inf. Comput. 208(11): 1258-1272 (2010) - [j40]Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot:
Sturmian Trees. Theory Comput. Syst. 46(3): 443-478 (2010) - [i5]Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin:
Symbolic dynamics. CoRR abs/1006.1265 (2010) - [i4]Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot:
Minimization of Automata. CoRR abs/1010.5318 (2010) - [i3]Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Bifix codes and Sturmian words. CoRR abs/1011.5369 (2010)
2000 – 2009
- 2009
- [j39]Jean Berstel, Luc Boasson, Olivier Carton:
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm. Theor. Comput. Sci. 410(30-32): 2811-2822 (2009) - [i2]Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot:
Infinite words without palindrome. CoRR abs/0903.2382 (2009) - 2008
- [j38]Jean Berstel, Tero Harju, Juhani Karhumäki:
Preface. RAIRO Theor. Informatics Appl. 42(4): 657 (2008) - [j37]Jean Berstel, Christophe Reutenauer:
Another proof of Soittola's theorem. Theor. Comput. Sci. 393(1-3): 196-203 (2008) - [j36]Jean Berstel, Christophe Reutenauer:
Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids. Theor. Comput. Sci. 400(1-3): 144-158 (2008) - 2007
- [j35]Jean Berstel, Dominique Perrin:
The origins of combinatorics on words. Eur. J. Comb. 28(3): 996-1022 (2007) - [c25]Jean Berstel:
Sturmian and Episturmian Words. CAI 2007: 23-47 - [c24]Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot:
A First Investigation of Sturmian Trees. STACS 2007: 73-84 - 2006
- [j34]Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin:
Operations preserving regular languages. Theor. Comput. Sci. 354(3): 405-420 (2006) - [c23]Jean Berstel, Alessandra Savelli:
Crochemore Factorization of Sturmian and Other Infinite Words. MFCS 2006: 157-166 - 2005
- [j33]Jean Berstel, Luc Boasson, Michel Latteux:
Mixed languages. Theor. Comput. Sci. 332(1-3): 179-198 (2005) - [j32]Jean Berstel:
Growth of repetition-free words -- a review. Theor. Comput. Sci. 340(1): 280-290 (2005) - [j31]Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, Pierluigi San Pietro:
A scalable formal method for design and automatic checking of user interfaces. ACM Trans. Softw. Eng. Methodol. 14(2): 124-167 (2005) - 2004
- [j30]Jean Berstel:
Review of "Automatic sequences: theory, applications, generalizations" by Jean-Paul Allouche and Jeffrey Shallit. Cambridge University Press. SIGACT News 35(1): 12-16 (2004) - [c22]Jean Berstel, Olivier Carton:
On the Complexity of Hopcroft's State Minimization Algorithm. CIAA 2004: 35-44 - 2003
- [j29]Jean Berstel, Juhani Karhumäki:
Combinatorics on words: a tutorial. Bull. EATCS 79: 178- (2003) - [c21]Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin:
Operations Preserving Recognizable Languages. FCT 2003: 343-354 - 2002
- [j28]Jean Berstel, Luc Boasson:
Formal properties of XML grammars and languages. Acta Informatica 38(9): 649-671 (2002) - [j27]Jean Berstel:
Recent Results on Extensions of Sturmian Words. Int. J. Algebra Comput. 12(1-2): 371-385 (2002) - [j26]Jean Berstel, Luc Boasson:
Shuffle factorization is unique. Theor. Comput. Sci. 273(1-2): 47-67 (2002) - [j25]Jean Berstel, Laurent Vuillon:
Coding rotations on intervals. Theor. Comput. Sci. 281(1-2): 99-107 (2002) - [c20]Jean Berstel, Luc Boasson:
Balanced Grammars and Their Languages. Formal and Natural Computing 2002: 3-25 - 2001
- [j24]Jean Berstel:
An Exercise on Fibonacci Representations. RAIRO Theor. Informatics Appl. 35(6): 491-498 (2001) - [c19]Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, Pierluigi San Pietro:
A Scalable Formal Method for Design and Automatic Checking of User Interfaces. ICSE 2001: 453-462 - 2000
- [c18]Jean Berstel, Luc Boasson:
XML Grammars. MFCS 2000: 182-191 - [i1]Jean Berstel, Luc Boasson:
Formal Properties of XML Grammars and Languages. CoRR cs.DM/0011011 (2000)
1990 – 1999
- 1999
- [j23]Jean Berstel, Luc Boasson:
A Note on List Languages. Int. J. Algebra Comput. 9(3-4): 263-270 (1999) - [j22]Jean Berstel, Luc Boasson:
Partial Words and a Theorem of Fine and Wilf. Theor. Comput. Sci. 218(1): 135-141 (1999) - [c17]Jean Berstel:
On the Index of Sturmian Words. Jewels are Forever 1999: 287-294 - 1997
- [j21]Jean Berstel, Luc Boasson:
The set of Lyndon words is not context-free. Bull. EATCS 63 (1997) - [j20]Jean Berstel, Luc Boasson:
The Set of Minimal Words of a Context-Free Language is Context-Free. J. Comput. Syst. Sci. 55(3): 477-488 (1997) - [j19]Jean Berstel, Aldo de Luca:
Sturmian Words, Lyndon Words and Trees. Theor. Comput. Sci. 178(1-2): 171-203 (1997) - [p2]Jean-Michel Autebert, Jean Berstel, Luc Boasson:
Context-Free Languages and Pushdown Automata. Handbook of Formal Languages (1) 1997: 111-174 - 1996
- [j18]Jean Berstel, Michel Pocchiola:
Random generation of finite Sturmian words. Discret. Math. 153(1-3): 29-39 (1996) - [j17]Jean Berstel, Luc Boasson:
Towards an Algebraic Theory of Context-Free Languages. Fundam. Informaticae 25(3): 217-239 (1996) - [j16]Jean Berstel, Jean-Eric Pin:
Local Languages and the Berry-Sethi Algorithm. Theor. Comput. Sci. 155(2): 439-446 (1996) - 1995
- [j15]Jean-Paul Allouche, André Arnold, Jean Berstel, Srecko Brlek, William Jockusch, Simon Plouffe, Bruce E. Sagan:
A relative of the Thue-Morse sequence. Discret. Math. 139(1-3): 455-461 (1995) - [c16]Jean Berstel:
Recent Results on Sturmian Words. Developments in Language Theory 1995: 13-24 - 1994
- [j14]Jean Berstel, Patrice Séébold:
A Remark on Morphic Sturmian Words. RAIRO Theor. Informatics Appl. 28(3-4): 255-263 (1994) - [j13]Jean Berstel, Michel Pocchiola:
Average Cost of Duval's Algorithm for Generating Lyndon Words. Theor. Comput. Sci. 132(2): 415-425 (1994) - [c15]Jean Berstel:
A Rewriting of Fife's Theorem about Overlap-Free Words. Results and Trends in Theoretical Computer Science 1994: 19-29 - 1993
- [j12]Jean Berstel, Patrice Séébold:
A Characterization of Overlap-Free Morphisms. Discret. Appl. Math. 46(3): 275-281 (1993) - [j11]Jean Berstel, Michel Pocchiola:
A Geometric Proof of the Enumeration Formula for Sturmian Words. Int. J. Algebra Comput. 3(3): 349-356 (1993) - [c14]Jean Berstel, Patrice Séébold:
A Characterization of Sturmian Morphisms. MFCS 1993: 281-290 - 1990
- [p1]Jean Berstel, Luc Boasson:
Context-Free Languages. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 59-102
1980 – 1989
- 1989
- [j10]Jean Berstel, Maxime Crochemore, Jean-Eric Pin:
Thue-Morse sequence and p-adic topology for the free monoid. Discret. Math. 76(2): 89-94 (1989) - [j9]Jean Berstel:
Langford strings are square free. Bull. EATCS 37: 127-128 (1989) - [j8]François Bergeron, Jean Berstel, Srecko Brlek, Christine Duboc:
Addition Chains Using Continued Fractions. J. Algorithms 10(3): 403-412 (1989) - [c13]Jean Berstel:
Properties of Infinite Words: Recent Result. STACS 1989: 36-46 - 1988
- [b3]Jean Berstel, Christophe Reutenauer:
Rational series and their languages. EATCS monographs on theoretical computer science 12, Springer 1988, ISBN 0387186263, pp. I-VIII, 1-151 - [c12]Jean Berstel, Christophe Reutenauer:
Zeta Functions of Recognizable Languages. ICALP 1988: 93-104 - [c11]Jean Berstel:
Finite automata and rational languages. An introduction. Formal Properties of Finite Automata and Applications 1988: 2-14 - 1987
- [j7]Jean Berstel, Srecko Brlek:
On the Length of Word Chains. Inf. Process. Lett. 26(1): 23-28 (1987) - 1986
- [j6]Jean Berstel:
Every Iterated Morphism Yields a co-CFL. Inf. Process. Lett. 22(1): 7-9 (1986) - [c10]Jean Berstel, Jacques Sakarovitch:
Recent Results in the Theory of Rational Sets. MFCS 1986: 15-28 - 1984
- [c9]Jean Berstel:
Some Recent Results on Squarefree Words. STACS 1984: 14-25 - 1982
- [j5]Jean Berstel, Christophe Reutenauer:
Recognizable Formal Power Series on Trees. Theor. Comput. Sci. 18: 115-148 (1982) - 1981
- [j4]Joffroy Beauquier, Jean Berstel:
More about the "Geography" of Context-Free Languages. Inf. Control. 49(2): 91-108 (1981) - [c8]Joffroy Beauquier, Jean Berstel:
More about the "Geography" of Context-Free Languages. MFCS 1981: 183-192 - 1980
- [j3]Jean Berstel:
Mots sans carre et morphismes iteres. Discret. Math. 29(3): 235-244 (1980) - [c7]Jean Berstel, Christophe Reutenauer:
Séries formelles reconnaissables d'arbres et applications. CLAAP 1980: 11-21
1970 – 1979
- 1979
- [b2]Jean Berstel:
Transductions and context-free languages. Teubner Studienbücher : Informatik 38, Teubner 1979, ISBN 3519023407, pp. 1-278 - [c6]Jean Berstel:
Sur les mots sans carré définis par un morphisme. ICALP 1979: 16-25 - 1977
- [c5]Jean Berstel:
Some Recent Results on Recognizable Formal Power Series. FCT 1977: 39-48 - 1975
- [c4]Jean Berstel, Mogens Nielsen:
The Growth Range Equivalence Problem for DOL Systems is Decidable. Automata, Languages, Development 1975: 161-178 - 1974
- [j2]Jean Berstel:
Sur une Conjecture de S. Greibach. Acta Informatica 3: 293-295 (1974) - [c3]Jean Berstel, Luc Boasson:
Une suite decroissante de cônes rationnels. ICALP 1974: 383-397 - 1973
- [j1]Jean Berstel:
Une Hiérarchie des Parties Rationelles de N². Math. Syst. Theory 7(2): 114-137 (1973) - 1972
- [b1]Jean Berstel:
Contribution a l'etude des proprietes arithmetiques des langages formels. Univ. Paris VII, 1972, pp. I-III, 1-131 - [c2]Jean Berstel:
On Sets of Numbers Recognized by Push-Down Automata. SWAT 1972: 200-206 - [c1]Jean Berstel:
Sur la densité asymptotique de langages formels. ICALP 1972: 345-358
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-05-02 20:59 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:
