Contribution a l'etude des proprietes arithmetiques des langages formels. - Jean Berstel (1972)

On Sets of Numbers Recognized by Push-Down Automata - Jean Berstel (SWAT, 1972)

Sur la densité asymptotique de langages formels. - Jean Berstel (ICALP, 1972)

Une Hiérarchie des Parties Rationelles de N². - Jean Berstel (Math. Syst. Theory, 1973)

Une suite decroissante de cônes rationnels. - Jean Berstel; Luc Boasson (ICALP, 1974)

Sur une Conjecture de S. Greibach. - Jean Berstel (Acta Informatica, 1974)

The Growth Range Equivalence Problem for DOL Systems is Decidable. - Jean Berstel; Mogens Nielsen (Automata, Languages, Development, 1975)

Some Recent Results on Recognizable Formal Power Series. - Jean Berstel (FCT, 1977)

Transductions and context-free languages. - Jean Berstel (Teubner, 1979)

Sur les mots sans carré définis par un morphisme. - Jean Berstel (ICALP, 1979)

Séries formelles reconnaissables d'arbres et applications. - Jean Berstel; Christophe Reutenauer (CLAAP, 1980)

Mots sans carre et morphismes iteres. - Jean Berstel (Discret. Math., 1980)

More about the "Geography" of Context-Free Languages - Joffroy Beauquier; Jean Berstel (Inf. Control., 1981)

Recognizable Formal Power Series on Trees. - Jean Berstel; Christophe Reutenauer (Theor. Comput. Sci., 1982)

Some Recent Results on Squarefree Words. - Jean Berstel (STACS, 1984)

Recent Results in the Theory of Rational Sets. - Jean Berstel; Jacques Sakarovitch (MFCS, 1986)

Every Iterated Morphism Yields a co-CFL. - Jean Berstel (Inf. Process. Lett., 1986)

On the Length of Word Chains. - Jean Berstel; Srecko Brlek (Inf. Process. Lett., 1987)

Rational series and their languages. - Jean Berstel; Christophe Reutenauer (Springer, 1988)

Zeta Functions of Recognizable Languages. - Jean Berstel; Christophe Reutenauer (ICALP, 1988)

Finite automata and rational languages. An introduction. - Jean Berstel (Formal Properties of Finite Automata and Applications, 1988)

Properties of Infinite Words: Recent Result. - Jean Berstel (STACS, 1989)

Thue-Morse sequence and p-adic topology for the free monoid. - Jean Berstel; Maxime Crochemore; Jean-Eric Pin (Discret. Math., 1989)

Langford strings are square free. - Jean Berstel (Bull. EATCS, 1989)

Addition Chains Using Continued Fractions. - François Bergeron; Jean Berstel; Srecko Brlek; Christine Duboc (J. Algorithms, 1989)

Context-Free Languages. - Jean Berstel; Luc Boasson (Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), 1990)

A Characterization of Sturmian Morphisms. - Jean Berstel; Patrice Séébold (MFCS, 1993)

A Characterization of Overlap-Free Morphisms. - Jean Berstel; Patrice Séébold (Discret. Appl. Math., 1993)

A Geometric Proof of the Enumeration Formula for Sturmian Words. - Jean Berstel; Michel Pocchiola (Int. J. Algebra Comput., 1993)

A Rewriting of Fife's Theorem about Overlap-Free Words. - Jean Berstel (Results and Trends in Theoretical Computer Science, 1994)

A Remark on Morphic Sturmian Words. - Jean Berstel; Patrice Séébold (RAIRO Theor. Informatics Appl., 1994)

Average Cost of Duval's Algorithm for Generating Lyndon Words. - Jean Berstel; Michel Pocchiola (Theor. Comput. Sci., 1994)

Recent Results on Sturmian Words. - Jean Berstel (Developments in Language Theory, 1995)

A relative of the Thue-Morse sequence. - Jean-Paul Allouche; André Arnold; Jean Berstel; Srecko Brlek; William Jockusch; Simon Plouffe; Bruce E. Sagan (Discret. Math., 1995)

Random generation of finite Sturmian words. - Jean Berstel; Michel Pocchiola (Discret. Math., 1996)

Towards an Algebraic Theory of Context-Free Languages. - Jean Berstel; Luc Boasson (Fundam. Informaticae, 1996)

Local Languages and the Berry-Sethi Algorithm. - Jean Berstel; Jean-Eric Pin (Theor. Comput. Sci., 1996)

The set of Lyndon words is not context-free. - Jean Berstel; Luc Boasson (Bull. EATCS, 1997)

The Set of Minimal Words of a Context-Free Language is Context-Free. - Jean Berstel; Luc Boasson (J. Comput. Syst. Sci., 1997)

Sturmian Words, Lyndon Words and Trees. - Jean Berstel; Aldo de Luca (Theor. Comput. Sci., 1997)

Context-Free Languages and Pushdown Automata. - Jean-Michel Autebert; Jean Berstel; Luc Boasson (Handbook of Formal Languages (1), 1997)

On the Index of Sturmian Words. - Jean Berstel (Jewels are Forever, 1999)

A Note on List Languages. - Jean Berstel; Luc Boasson (Int. J. Algebra Comput., 1999)

Partial Words and a Theorem of Fine and Wilf. - Jean Berstel; Luc Boasson (Theor. Comput. Sci., 1999)

XML Grammars. - Jean Berstel; Luc Boasson (MFCS, 2000)

An Exercise on Fibonacci Representations. - Jean Berstel (RAIRO Theor. Informatics Appl., 2001)

Balanced Grammars and Their Languages. - Jean Berstel; Luc Boasson (Formal and Natural Computing, 2002)

Formal properties of XML grammars and languages. - Jean Berstel; Luc Boasson (Acta Informatica, 2002)

Recent Results on Extensions of Sturmian Words. - Jean Berstel (Int. J. Algebra Comput., 2002)

Shuffle factorization is unique. - Jean Berstel; Luc Boasson (Theor. Comput. Sci., 2002)

Coding rotations on intervals. - Jean Berstel; Laurent Vuillon (Theor. Comput. Sci., 2002)

Operations Preserving Recognizable Languages. - Jean Berstel; Luc Boasson; Olivier Carton; Bruno Petazzoni; Jean-Eric Pin (FCT, 2003)

Combinatorics on words: a tutorial. - Jean Berstel; Juhani Karhumäki (Bull. EATCS, 2003)

On the Complexity of Hopcroft's State Minimization Algorithm. - Jean Berstel; Olivier Carton (CIAA, 2004)

Review of "Automatic sequences: theory, applications, generalizations" by Jean-Paul Allouche and Jeffrey Shallit. Cambridge University Press. - Jean Berstel (SIGACT News, 2004)

Growth of repetition-free words – a review. - Jean Berstel (Theor. Comput. Sci., 2005)

Mixed languages. - Jean Berstel; Luc Boasson; Michel Latteux (Theor. Comput. Sci., 2005)

A scalable formal method for design and automatic checking of user interfaces. - Jean Berstel; Stefano Crespi-Reghizzi; Gilles Roussel 001; Pierluigi San Pietro (ACM Trans. Softw. Eng. Methodol., 2005)

Crochemore Factorization of Sturmian and Other Infinite Words. - Jean Berstel; Alessandra Savelli (MFCS, 2006)

Operations preserving regular languages. - Jean Berstel; Luc Boasson; Olivier Carton; Bruno Petazzoni; Jean-Eric Pin (Theor. Comput. Sci., 2006)

Sturmian and Episturmian Words. - Jean Berstel (CAI, 2007)

A First Investigation of Sturmian Trees. - Jean Berstel; Luc Boasson; Olivier Carton; Isabelle Fagnot (STACS, 2007)

The origins of combinatorics on words. - Jean Berstel; Dominique Perrin (Eur. J. Comb., 2007)

Preface. - Jean Berstel; Tero Harju; Juhani Karhumäki (RAIRO Theor. Informatics Appl., 2008)

Another proof of Soittola's theorem. - Jean Berstel; Christophe Reutenauer (Theor. Comput. Sci., 2008)

Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids. - Jean Berstel; Christophe Reutenauer (Theor. Comput. Sci., 2008)

Infinite words without palindrome - Jean Berstel; Luc Boasson; Olivier Carton; Isabelle Fagnot (CoRR, 2009)

Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm. - Jean Berstel; Luc Boasson; Olivier Carton (Theor. Comput. Sci., 2009)

Codes and Automata. - Jean Berstel; Dominique Perrin; Christophe Reutenauer (Cambridge University Press, 2010)

Symbolic dynamics - Marie-Pierre Béal; Jean Berstel; Søren Eilers; Dominique Perrin (CoRR, 2010)

Minimization of Automata - Jean Berstel; Luc Boasson; Olivier Carton; Isabelle Fagnot (CoRR, 2010)

Bifix codes and Sturmian words - Jean Berstel; Clelia de Felice; Dominique Perrin; Christophe Reutenauer; Giuseppina Rindone (CoRR, 2010)

The expressive power of the shuffle product. - Jean Berstel; Luc Boasson; Olivier Carton; Jean-Eric Pin; Antonio Restivo (Inf. Comput., 2010)

Sturmian Trees. - Jean Berstel; Luc Boasson; Olivier Carton; Isabelle Fagnot (Theory Comput. Syst., 2010)

Recent results on syntactic groups of prefix codes. - Jean Berstel; Clelia de Felice; Dominique Perrin; Christophe Reutenauer; Giuseppina Rindone (Eur. J. Comb., 2012)

Splicing systems and the Chomsky hierarchy. - Jean Berstel; Luc Boasson; Isabelle Fagnot (Theor. Comput. Sci., 2012)

Lettre à Christophe Reutenauer. - Jean Berstel (Int. J. Algebra Comput., 2013)

Symbolic dynamics. - Marie-Pierre Béal; Jean Berstel; Søren Eilers; Dominique Perrin (Handbook of Automata Theory (II.), 2021)

Minimisation of automata. - Jean Berstel; Luc Boasson; Olivier Carton; Isabelle Fagnot (Handbook of Automata Theory (I.), 2021)