Jean Berstel

Publication Activity (10 Years)

Years Active: 1972-2013
Publications (10 Years): 0

Top Venues

Eur. J. Comb.

Int. J. Algebra Comput.

Theor. Comput. Sci.

Univ. Paris VII (PHD)

Education History

Univ. Paris VII

PHD

Publications

Jean Berstel
Lettre à Christophe Reutenauer. Int. J. Algebra Comput. 23 (4) (2013)
Jean Berstel, Luc Boasson, Isabelle Fagnot
Splicing systems and the Chomsky hierarchy. Theor. Comput. Sci. 436 (2012)
Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Recent results on syntactic groups of prefix codes. Eur. J. Comb. 33 (7) (2012)
Jean Berstel, Luc Boasson, Isabelle Fagnot
Splicing systems and the Chomsky hierarchy CoRR (2011)
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
Minimization of Automata CoRR (2010)
Jean Berstel, Luc Boasson, Olivier Carton, Jean-Eric Pin, Antonio Restivo
The expressive power of the shuffle product. Inf. Comput. 208 (11) (2010)
Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Bifix codes and Sturmian words CoRR (2010)
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
Sturmian Trees. Theory Comput. Syst. 46 (3) (2010)
Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin
Symbolic dynamics CoRR (2010)
Jean Berstel, Luc Boasson, Olivier Carton
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm. Theor. Comput. Sci. 410 (30-32) (2009)
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
Infinite words without palindrome CoRR (2009)
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) (2008)
Jean Berstel, Tero Harju, Juhani Karhumäki
Preface. RAIRO Theor. Informatics Appl. 42 (4) (2008)
Jean Berstel, Christophe Reutenauer
Another proof of Soittola's theorem. Theor. Comput. Sci. 393 (1-3) (2008)
Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
A First Investigation of Sturmian Trees. STACS (2007)
Jean Berstel
Sturmian and Episturmian Words. CAI (2007)
Jean Berstel, Dominique Perrin
The origins of combinatorics on words. Eur. J. Comb. 28 (3) (2007)
Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin
Operations preserving regular languages. Theor. Comput. Sci. 354 (3) (2006)
Jean Berstel, Alessandra Savelli
Crochemore Factorization of Sturmian and Other Infinite Words. MFCS (2006)
Jean Berstel
Growth of repetition-free words -- a review. Theor. Comput. Sci. 340 (1) (2005)
Jean Berstel, Luc Boasson, Michel Latteux
Mixed languages. Theor. Comput. Sci. 332 (1-3) (2005)
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) (2005)
Jean Berstel, Olivier Carton
On the Complexity of Hopcroft's State Minimization Algorithm. CIAA (2004)
Jean Berstel
Review of "Automatic sequences: theory, applications, generalizations" by Jean-Paul Allouche and Jeffrey Shallit. Cambridge University Press. SIGACT News 35 (1) (2004)
Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin
Operations Preserving Recognizable Languages. FCT (2003)
Jean Berstel, Juhani Karhumäki
Combinatorics on words: a tutorial. Bull. EATCS 79 (2003)
Jean Berstel, Luc Boasson
Shuffle factorization is unique. Theor. Comput. Sci. 273 (1-2) (2002)
Jean Berstel
Recent Results on Extensions of Sturmian Words. Int. J. Algebra Comput. 12 (1-2) (2002)
Jean Berstel, Laurent Vuillon
Coding rotations on intervals. Theor. Comput. Sci. 281 (1-2) (2002)
Jean Berstel, Luc Boasson
Balanced Grammars and Their Languages. Formal and Natural Computing (2002)
Jean Berstel, Luc Boasson
Formal properties of XML grammars and languages. Acta Informatica 38 (9) (2002)
Jean Berstel
An Exercise on Fibonacci Representations. RAIRO Theor. Informatics Appl. 35 (6) (2001)
Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, Pierluigi San Pietro
A Scalable Formal Method for Design and Automatic Checking of User Interfaces. ICSE (2001)
Jean Berstel, Luc Boasson
Formal Properties of XML Grammars and Languages CoRR (2000)
Jean Berstel, Luc Boasson
XML Grammars. MFCS (2000)
Jean Berstel, Luc Boasson
A Note on List Languages. Int. J. Algebra Comput. 9 (3-4) (1999)
Jean Berstel
On the Index of Sturmian Words. Jewels are Forever (1999)
Jean Berstel, Luc Boasson
Partial Words and a Theorem of Fine and Wilf. Theor. Comput. Sci. 218 (1) (1999)
Jean Berstel, Luc Boasson
The set of Lyndon words is not context-free. Bull. EATCS 63 (1997)
Jean Berstel, Aldo de Luca
Sturmian Words, Lyndon Words and Trees. Theor. Comput. Sci. 178 (1-2) (1997)
Jean Berstel, Luc Boasson
The Set of Minimal Words of a Context-Free Language is Context-Free. J. Comput. Syst. Sci. 55 (3) (1997)
Jean Berstel, Luc Boasson
Towards an Algebraic Theory of Context-Free Languages. Fundam. Informaticae 25 (3) (1996)
Jean Berstel, Michel Pocchiola
Random generation of finite Sturmian words. Discret. Math. 153 (1-3) (1996)
Jean Berstel, Jean-Eric Pin
Local Languages and the Berry-Sethi Algorithm. Theor. Comput. Sci. 155 (2) (1996)
Jean Berstel
Recent Results on Sturmian Words. Developments in Language Theory (1995)
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) (1995)
Jean Berstel, Michel Pocchiola
Average Cost of Duval's Algorithm for Generating Lyndon Words. Theor. Comput. Sci. 132 (2) (1994)
Jean Berstel
A Rewriting of Fife's Theorem about Overlap-Free Words. Results and Trends in Theoretical Computer Science (1994)
Jean Berstel, Patrice Séébold
A Remark on Morphic Sturmian Words. RAIRO Theor. Informatics Appl. 28 (3-4) (1994)
Jean Berstel, Michel Pocchiola
A Geometric Proof of the Enumeration Formula for Sturmian Words. Int. J. Algebra Comput. 3 (3) (1993)
Jean Berstel, Patrice Séébold
A Characterization of Sturmian Morphisms. MFCS (1993)
Jean Berstel, Patrice Séébold
A Characterization of Overlap-Free Morphisms. Discret. Appl. Math. 46 (3) (1993)
Jean Berstel, Maxime Crochemore, Jean-Eric Pin
Thue-Morse sequence and p-adic topology for the free monoid. Discret. Math. 76 (2) (1989)
François Bergeron, Jean Berstel, Srecko Brlek, Christine Duboc
Addition Chains Using Continued Fractions. J. Algorithms 10 (3) (1989)
Jean Berstel
Langford strings are square free. Bull. EATCS 37 (1989)
Jean Berstel
Properties of Infinite Words: Recent Result. STACS (1989)
Jean Berstel, Christophe Reutenauer
Zeta Functions of Recognizable Languages. ICALP (1988)
Jean Berstel
Finite automata and rational languages. An introduction. Formal Properties of Finite Automata and Applications (1988)
Jean Berstel, Srecko Brlek
On the Length of Word Chains. Inf. Process. Lett. 26 (1) (1987)
Jean Berstel, Jacques Sakarovitch
Recent Results in the Theory of Rational Sets. MFCS (1986)
Jean Berstel
Every Iterated Morphism Yields a co-CFL. Inf. Process. Lett. 22 (1) (1986)
Jean Berstel
Some Recent Results on Squarefree Words. STACS (1984)
Jean Berstel, Christophe Reutenauer
Recognizable Formal Power Series on Trees. Theor. Comput. Sci. 18 (1982)
Joffroy Beauquier, Jean Berstel
More about the "Geography" of Context-Free Languages Inf. Control. 49 (2) (1981)
Joffroy Beauquier, Jean Berstel
More about the "Geography" of Context-Free Languages. MFCS (1981)
Jean Berstel, Christophe Reutenauer
Séries formelles reconnaissables d'arbres et applications. CLAAP (1980)
Jean Berstel
Mots sans carre et morphismes iteres. Discret. Math. 29 (3) (1980)
Jean Berstel
Sur les mots sans carré définis par un morphisme. ICALP (1979)
Jean Berstel
Some Recent Results on Recognizable Formal Power Series. FCT (1977)
Jean Berstel, Mogens Nielsen
The Growth Range Equivalence Problem for DOL Systems is Decidable. Automata, Languages, Development (1975)
Jean Berstel
Sur une Conjecture de S. Greibach. Acta Informatica 3 (1974)
Jean Berstel, Luc Boasson
Une suite decroissante de cônes rationnels. ICALP (1974)
Jean Berstel
Une Hiérarchie des Parties Rationelles de N². Math. Syst. Theory 7 (2) (1973)
Jean Berstel
Sur la densité asymptotique de langages formels. ICALP (1972)
Jean Berstel
On Sets of Numbers Recognized by Push-Down Automata SWAT (1972)

Jean Berstel.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jean Berstel