Jean Berstel

83 papers A* 5A 3B 7C 2Journal 50Unranked 8
YearRankTypeTitle / Venue / Authors
2021 — ch.
Minimisation of automata.
Handbook of Automata Theory (I.)
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
2021 — ch.
Symbolic dynamics.
Handbook of Automata Theory (II.)
Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin
2013 J jnl
Lettre à Christophe Reutenauer.
Int. J. Algebra Comput.
Jean Berstel
2012 J jnl
Recent results on syntactic groups of prefix codes.
Eur. J. Comb.
Jean Berstel, Clelia De Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
2012 J jnl
Splicing systems and the Chomsky hierarchy.
Theor. Comput. Sci.
Jean Berstel, Luc Boasson, Isabelle Fagnot
2011 J jnl
Splicing systems and the Chomsky hierarchy
CoRR
Jean Berstel, Luc Boasson, Isabelle Fagnot
2010 J jnl
Bifix codes and Sturmian words
CoRR
Jean Berstel, Clelia De Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
2010 — book
Codes and Automata.
Jean Berstel, Dominique Perrin, Christophe Reutenauer
2010 J jnl
Minimization of Automata
CoRR
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
2010 J jnl
Sturmian Trees.
Theory Comput. Syst.
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
2010 J jnl
Symbolic dynamics
CoRR
Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin
2010 J jnl
The expressive power of the shuffle product.
Inf. Comput.
Jean Berstel, Luc Boasson, Olivier Carton, Jean-Eric Pin, Antonio Restivo
2009 J jnl
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm.
Theor. Comput. Sci.
Jean Berstel, Luc Boasson, Olivier Carton
2009 J jnl
Infinite words without palindrome
CoRR
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
2008 J jnl
Another proof of Soittola's theorem.
Theor. Comput. Sci.
Jean Berstel, Christophe Reutenauer
2008 J jnl
Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids.
Theor. Comput. Sci.
Jean Berstel, Christophe Reutenauer
2008 J jnl
Preface.
RAIRO Theor. Informatics Appl.
Jean Berstel, Tero Harju, Juhani Karhumäki
2007 A conf
A First Investigation of Sturmian Trees.
STACS
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
2007 — conf
Sturmian and Episturmian Words.
CAI
Jean Berstel
2007 J jnl
The origins of combinatorics on words.
Eur. J. Comb.
Jean Berstel, Dominique Perrin
2006 B conf
Crochemore Factorization of Sturmian and Other Infinite Words.
MFCS
Jean Berstel, Alessandra Savelli
2006 J jnl
Operations preserving regular languages.
Theor. Comput. Sci.
Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin
2005 J jnl
A scalable formal method for design and automatic checking of user interfaces.
ACM Trans. Softw. Eng. Methodol.
Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, Pierluigi San Pietro
2005 J jnl
Growth of repetition-free words -- a review.
Theor. Comput. Sci.
Jean Berstel
2005 J jnl
Mixed languages.
Theor. Comput. Sci.
Jean Berstel, Luc Boasson, Michel Latteux
2004 C conf
On the Complexity of Hopcroft's State Minimization Algorithm.
CIAA
Jean Berstel, Olivier Carton
2004 J jnl
Review of "Automatic sequences: theory, applications, generalizations" by Jean-Paul Allouche and Jeffrey Shallit. Cambridge University Press.
SIGACT News
Jean Berstel
2003 J jnl
Combinatorics on words: a tutorial.
Bull. EATCS
Jean Berstel, Juhani Karhumäki
2003 B conf
Operations Preserving Recognizable Languages.
FCT
Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin
2002 — conf
Balanced Grammars and Their Languages.
Formal and Natural Computing
Jean Berstel, Luc Boasson
2002 J jnl
Coding rotations on intervals.
Theor. Comput. Sci.
Jean Berstel, Laurent Vuillon
2002 J jnl
Formal properties of XML grammars and languages.
Acta Informatica
Jean Berstel, Luc Boasson
2002 J jnl
Recent Results on Extensions of Sturmian Words.
Int. J. Algebra Comput.
Jean Berstel
2002 J jnl
Shuffle factorization is unique.
Theor. Comput. Sci.
Jean Berstel, Luc Boasson
2001 A* conf
A Scalable Formal Method for Design and Automatic Checking of User Interfaces.
ICSE
Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, Pierluigi San Pietro
2001 J jnl
An Exercise on Fibonacci Representations.
RAIRO Theor. Informatics Appl.
Jean Berstel
2000 J jnl
Formal Properties of XML Grammars and Languages
CoRR
Jean Berstel, Luc Boasson
2000 B conf
XML Grammars.
MFCS
Jean Berstel, Luc Boasson
1999 J jnl
A Note on List Languages.
Int. J. Algebra Comput.
Jean Berstel, Luc Boasson
1999 — conf
On the Index of Sturmian Words.
Jewels are Forever
Jean Berstel
1999 J jnl
Partial Words and a Theorem of Fine and Wilf.
Theor. Comput. Sci.
Jean Berstel, Luc Boasson
1997 — ch.
Context-Free Languages and Pushdown Automata.
Handbook of Formal Languages (1)
Jean-Michel Autebert, Jean Berstel, Luc Boasson
1997 J jnl
Sturmian Words, Lyndon Words and Trees.
Theor. Comput. Sci.
Jean Berstel, Aldo de Luca
1997 J jnl
The Set of Minimal Words of a Context-Free Language is Context-Free.
J. Comput. Syst. Sci.
Jean Berstel, Luc Boasson
1997 J jnl
The set of Lyndon words is not context-free.
Bull. EATCS
Jean Berstel, Luc Boasson
1996 J jnl
Local Languages and the Berry-Sethi Algorithm.
Theor. Comput. Sci.
Jean Berstel, Jean-Eric Pin
1996 J jnl
Random generation of finite Sturmian words.
Discret. Math.
Jean Berstel, Michel Pocchiola
1996 J jnl
Towards an Algebraic Theory of Context-Free Languages.
Fundam. Informaticae
Jean Berstel, Luc Boasson
1995 J jnl
A relative of the Thue-Morse sequence.
Discret. Math.
Jean-Paul Allouche, André Arnold, Jean Berstel, Srecko Brlek, William Jockusch, Simon Plouffe, Bruce E. Sagan
1995 C conf
Recent Results on Sturmian Words.
Developments in Language Theory
Jean Berstel
1994 J jnl
A Remark on Morphic Sturmian Words.
RAIRO Theor. Informatics Appl.
Jean Berstel, Patrice Séébold
1994 — conf
A Rewriting of Fife's Theorem about Overlap-Free Words.
Results and Trends in Theoretical Computer Science
Jean Berstel
1994 J jnl
Average Cost of Duval's Algorithm for Generating Lyndon Words.
Theor. Comput. Sci.
Jean Berstel, Michel Pocchiola
1993 J jnl
A Characterization of Overlap-Free Morphisms.
Discret. Appl. Math.
Jean Berstel, Patrice Séébold
1993 B conf
A Characterization of Sturmian Morphisms.
MFCS
Jean Berstel, Patrice Séébold
1993 J jnl
A Geometric Proof of the Enumeration Formula for Sturmian Words.
Int. J. Algebra Comput.
Jean Berstel, Michel Pocchiola
1990 — ch.
Context-Free Languages.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
Jean Berstel, Luc Boasson
1989 J jnl
Addition Chains Using Continued Fractions.
J. Algorithms
François Bergeron, Jean Berstel, Srecko Brlek, Christine Duboc
1989 J jnl
Langford strings are square free.
Bull. EATCS
Jean Berstel
1989 A conf
Properties of Infinite Words: Recent Result.
STACS
Jean Berstel
1989 J jnl
Thue-Morse sequence and p-adic topology for the free monoid.
Discret. Math.
Jean Berstel, Maxime Crochemore, Jean-Eric Pin
1988 — conf
Finite automata and rational languages. An introduction.
Formal Properties of Finite Automata and Applications
Jean Berstel
1988 — book
Rational series and their languages.
Jean Berstel, Christophe Reutenauer
1988 A* conf
Zeta Functions of Recognizable Languages.
ICALP
Jean Berstel, Christophe Reutenauer
1987 J jnl
On the Length of Word Chains.
Inf. Process. Lett.
Jean Berstel, Srecko Brlek
1986 J jnl
Every Iterated Morphism Yields a co-CFL.
Inf. Process. Lett.
Jean Berstel
1986 B conf
Recent Results in the Theory of Rational Sets.
MFCS
Jean Berstel, Jacques Sakarovitch
1984 A conf
Some Recent Results on Squarefree Words.
STACS
Jean Berstel
1982 J jnl
Recognizable Formal Power Series on Trees.
Theor. Comput. Sci.
Jean Berstel, Christophe Reutenauer
1981 J jnl
More about the "Geography" of Context-Free Languages
Inf. Control.
Joffroy Beauquier, Jean Berstel
1981 B conf
More about the "Geography" of Context-Free Languages.
MFCS
Joffroy Beauquier, Jean Berstel
1980 J jnl
Mots sans carre et morphismes iteres.
Discret. Math.
Jean Berstel
1980 — conf
Séries formelles reconnaissables d'arbres et applications.
CLAAP
Jean Berstel, Christophe Reutenauer
1979 A* conf
Sur les mots sans carré définis par un morphisme.
ICALP
Jean Berstel
1979 — book
Transductions and context-free languages.
Jean Berstel
1977 B conf
Some Recent Results on Recognizable Formal Power Series.
FCT
Jean Berstel
1975 — conf
The Growth Range Equivalence Problem for DOL Systems is Decidable.
Automata, Languages, Development
Jean Berstel, Mogens Nielsen
1974 J jnl
Sur une Conjecture de S. Greibach.
Acta Informatica
Jean Berstel
1974 A* conf
Une suite decroissante de cônes rationnels.
ICALP
Jean Berstel, Luc Boasson
1973 J jnl
Une Hiérarchie des Parties Rationelles de N².
Math. Syst. Theory
Jean Berstel
1972 — —
Contribution a l'etude des proprietes arithmetiques des langages formels.
Jean Berstel
1972 — conf
On Sets of Numbers Recognized by Push-Down Automata
SWAT
Jean Berstel
1972 A* conf
Sur la densité asymptotique de langages formels.
ICALP
Jean Berstel