We stand with Ukraine  

Jean Berstel

Affiliations:
  • University Paris-Est Marne-la-Vallée, France


According to our database1, Jean Berstel authored at least 79 papers between 1972 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Minimisation of automata.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
,
Olivier Carton
,
Isabelle Fagnot
Proceedings of the Handbook of Automata Theory., 2021

Symbolic dynamics.
[BibTeX]
[DOI]
Marie-Pierre Béal
,
Jean Berstel
,
Søren Eilers
,
Dominique Perrin
Proceedings of the Handbook of Automata Theory., 2021

2013
Lettre à Christophe Reutenauer.
[BibTeX]
[DOI]
Jean Berstel
Int. J. Algebra Comput., 2013

2012
Splicing systems and the Chomsky hierarchy.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
,
Isabelle Fagnot
Theor. Comput. Sci., 2012

Recent results on syntactic groups of prefix codes.
[BibTeX]
[DOI]
Jean Berstel
,
Clelia de Felice
,
Dominique Perrin
,
Christophe Reutenauer
,
Giuseppina Rindone
Eur. J. Comb., 2012

2010
Sturmian Trees.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
,
Olivier Carton
,
Isabelle Fagnot
Theory Comput. Syst., 2010

The expressive power of the shuffle product.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
,
Olivier Carton
,
Jean-Eric Pin
,
Antonio Restivo
Inf. Comput., 2010

Bifix codes and Sturmian words
[BibTeX]
[DOI]
Jean Berstel
,
Clelia de Felice
,
Dominique Perrin
,
Christophe Reutenauer
,
Giuseppina Rindone
CoRR, 2010

Minimization of Automata
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
,
Olivier Carton
,
Isabelle Fagnot
CoRR, 2010

Symbolic dynamics
[BibTeX]
[DOI]
Marie-Pierre Béal
,
Jean Berstel
,
Søren Eilers
,
Dominique Perrin
CoRR, 2010

Codes and Automata.
[BibTeX]
Jean Berstel
,
Dominique Perrin
,
Christophe Reutenauer
Encyclopedia of mathematics and its applications 129, Cambridge University Press, ISBN: 978-0-521-88831-8, 2010

2009
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
,
Olivier Carton
Theor. Comput. Sci., 2009

Infinite words without palindrome
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
,
Olivier Carton
,
Isabelle Fagnot
CoRR, 2009

2008
Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids.
[BibTeX]
[DOI]
Jean Berstel
,
Christophe Reutenauer
Theor. Comput. Sci., 2008

Another proof of Soittola's theorem.
[BibTeX]
[DOI]
Jean Berstel
,
Christophe Reutenauer
Theor. Comput. Sci., 2008

Preface.
[BibTeX]
[DOI]
Jean Berstel
,
Tero Harju
,
Juhani Karhumäki
RAIRO Theor. Informatics Appl., 2008

2007
The origins of combinatorics on words.
[BibTeX]
[DOI]
Jean Berstel
,
Dominique Perrin
Eur. J. Comb., 2007

A First Investigation of Sturmian Trees.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
,
Olivier Carton
,
Isabelle Fagnot
Proceedings of the STACS 2007, 2007

Sturmian and Episturmian Words.
[BibTeX]
[DOI]
Jean Berstel
Proceedings of the Algebraic Informatics, Second International Conference, 2007

2006
Operations preserving regular languages.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
,
Olivier Carton
,
Bruno Petazzoni
,
Jean-Eric Pin
Theor. Comput. Sci., 2006

Crochemore Factorization of Sturmian and Other Infinite Words.
[BibTeX]
[DOI]
Jean Berstel
,
Alessandra Savelli
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005
A scalable formal method for design and automatic checking of user interfaces.
[BibTeX]
[DOI]
Jean Berstel
,
Stefano Crespi-Reghizzi
,
Gilles Roussel
,
Pierluigi San Pietro
ACM Trans. Softw. Eng. Methodol., 2005

Mixed languages.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
,
Michel Latteux
Theor. Comput. Sci., 2005

Growth of repetition-free words -- a review.
[BibTeX]
[DOI]
Jean Berstel
Theor. Comput. Sci., 2005

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

On the Complexity of Hopcroft's State Minimization Algorithm.
[BibTeX]
[DOI]
Jean Berstel
,
Olivier Carton
Proceedings of the Implementation and Application of Automata, 2004

2003
Combinatorics on words: a tutorial.
[BibTeX]
Jean Berstel
,
Juhani Karhumäki
Bull. EATCS, 2003

Operations Preserving Recognizable Languages.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
,
Olivier Carton
,
Bruno Petazzoni
,
Jean-Eric Pin
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002
Coding rotations on intervals.
[BibTeX]
[DOI]
Jean Berstel
,
Laurent Vuillon
Theor. Comput. Sci., 2002

Shuffle factorization is unique.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
Theor. Comput. Sci., 2002

Recent Results on Extensions of Sturmian Words.
[BibTeX]
[DOI]
Jean Berstel
Int. J. Algebra Comput., 2002

Formal properties of XML grammars and languages.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
Acta Informatica, 2002

Balanced Grammars and Their Languages.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
Proceedings of the Formal and Natural Computing, 2002

2001
An Exercise on Fibonacci Representations.
[BibTeX]
[DOI]
Jean Berstel
RAIRO Theor. Informatics Appl., 2001

2000
XML Grammars.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999
Partial Words and a Theorem of Fine and Wilf.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
Theor. Comput. Sci., 1999

A Note on List Languages.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
Int. J. Algebra Comput., 1999

On the Index of Sturmian Words.
[BibTeX]
Jean Berstel
Proceedings of the Jewels are Forever, 1999

1997
Context-Free Languages and Pushdown Automata.
[BibTeX]
[DOI]
Jean-Michel Autebert
,
Jean Berstel
,
Luc Boasson
Proceedings of the Handbook of Formal Languages, Volume 1: Word, Language, Grammar., 1997

Sturmian Words, Lyndon Words and Trees.
[BibTeX]
[DOI]
Jean Berstel
,
Aldo de Luca
Theor. Comput. Sci., 1997

The Set of Minimal Words of a Context-Free Language is Context-Free.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
J. Comput. Syst. Sci., 1997

The set of Lyndon words is not context-free.
[BibTeX]
Jean Berstel
,
Luc Boasson
Bull. EATCS, 1997

1996
Local Languages and the Berry-Sethi Algorithm.
[BibTeX]
[DOI]
Jean Berstel
,
Jean-Eric Pin
Theor. Comput. Sci., 1996

Towards an Algebraic Theory of Context-Free Languages.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
Fundam. Informaticae, 1996

Random generation of finite Sturmian words.
[BibTeX]
[DOI]
Jean Berstel
,
Michel Pocchiola
Discret. Math., 1996

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

Recent Results on Sturmian Words.
[BibTeX]
Jean Berstel
Proceedings of the Developments in Language Theory II, 1995

1994
Average Cost of Duval's Algorithm for Generating Lyndon Words.
[BibTeX]
[DOI]
Jean Berstel
,
Michel Pocchiola
Theor. Comput. Sci., 1994

A Remark on Morphic Sturmian Words.
[BibTeX]
[DOI]
Jean Berstel
,
Patrice Séébold
RAIRO Theor. Informatics Appl., 1994

A Rewriting of Fife's Theorem about Overlap-Free Words.
[BibTeX]
[DOI]
Jean Berstel
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993
A Geometric Proof of the Enumeration Formula for Sturmian Words.
[BibTeX]
[DOI]
Jean Berstel
,
Michel Pocchiola
Int. J. Algebra Comput., 1993

A Characterization of Overlap-Free Morphisms.
[BibTeX]
[DOI]
Jean Berstel
,
Patrice Séébold
Discret. Appl. Math., 1993

A Characterization of Sturmian Morphisms.
[BibTeX]
[DOI]
Jean Berstel
,
Patrice Séébold
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1990
Context-Free Languages.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
Proceedings of the Handbook of Theoretical Computer Science, 1990

1989
Addition Chains Using Continued Fractions.
[BibTeX]
[DOI]
François Bergeron
,
Jean Berstel
,
Srecko Brlek
,
Christine Duboc
J. Algorithms, 1989

Langford strings are square free.
[BibTeX]
Jean Berstel
Bull. EATCS, 1989

Thue-Morse sequence and p-adic topology for the free monoid.
[BibTeX]
[DOI]
Jean Berstel
,
Maxime Crochemore
,
Jean-Eric Pin
Discret. Math., 1989

Properties of Infinite Words: Recent Result.
[BibTeX]
[DOI]
Jean Berstel
Proceedings of the STACS 89, 1989

1988
Finite automata and rational languages. An introduction.
[BibTeX]
[DOI]
Jean Berstel
Proceedings of the Formal Properties of Finite Automata and Applications, 1988

Zeta Functions of Recognizable Languages.
[BibTeX]
[DOI]
Jean Berstel
,
Christophe Reutenauer
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

Rational series and their languages.
[BibTeX]
[DOI]
Jean Berstel
,
Christophe Reutenauer
EATCS monographs on theoretical computer science 12, Springer, ISBN: 0387186263, 1988

1987
On the Length of Word Chains.
[BibTeX]
[DOI]
Jean Berstel
,
Srecko Brlek
Inf. Process. Lett., 1987

1986
Every Iterated Morphism Yields a co-CFL.
[BibTeX]
[DOI]
Jean Berstel
Inf. Process. Lett., 1986

Recent Results in the Theory of Rational Sets.
[BibTeX]
[DOI]
Jean Berstel
,
Jacques Sakarovitch
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1984
Some Recent Results on Squarefree Words.
[BibTeX]
[DOI]
Jean Berstel
Proceedings of the STACS 84, 1984

1982
Recognizable Formal Power Series on Trees.
[BibTeX]
[DOI]
Jean Berstel
,
Christophe Reutenauer
Theor. Comput. Sci., 1982

1981
More about the "Geography" of Context-Free Languages
[BibTeX]
[DOI]
Joffroy Beauquier
,
Jean Berstel
Inf. Control., May, 1981

1980
Mots sans carre et morphismes iteres.
[BibTeX]
[DOI]
Jean Berstel
Discret. Math., 1980

Séries formelles reconnaissables d'arbres et applications.
[BibTeX]
Jean Berstel
,
Christophe Reutenauer
Proceedings of the Proc. 5eme Colleque de Lille sur les Arbres en Algebre et en Programmation, 1980

1979
Sur les mots sans carré définis par un morphisme.
[BibTeX]
[DOI]
Jean Berstel
Proceedings of the Automata, 1979

Transductions and context-free languages.
[BibTeX]
[DOI]
Jean Berstel
Teubner Studienbücher : Informatik 38, Teubner, ISBN: 3519023407, 1979

1977
Some Recent Results on Recognizable Formal Power Series.
[BibTeX]
[DOI]
Jean Berstel
Proceedings of the Fundamentals of Computation Theory, 1977

1975
The Growth Range Equivalence Problem for DOL Systems is Decidable.
[BibTeX]
Jean Berstel
,
Mogens Nielsen
Proceedings of the Automata, Languages, Development: At the crossroads of biology, mathematics and computer science, result of an international conference held at Noordwijkerhout, The Netherlands, March 31, 1975

1974
Sur une Conjecture de S. Greibach.
[BibTeX]
[DOI]
Jean Berstel
Acta Informatica, 1974

Une suite decroissante de cônes rationnels.
[BibTeX]
[DOI]
Jean Berstel
,
Luc Boasson
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1973
Une Hiérarchie des Parties Rationelles de N².
[BibTeX]
[DOI]
Jean Berstel
Math. Syst. Theory, 1973

1972
Sur la densité asymptotique de langages formels.
[BibTeX]
Jean Berstel
Proceedings of the Automata, 1972

On Sets of Numbers Recognized by Push-Down Automata
[BibTeX]
[DOI]
Jean Berstel
Proceedings of the 13th Annual Symposium on Switching and Automata Theory, 1972

Contribution a l'etude des proprietes arithmetiques des langages formels.
[BibTeX]
Jean Berstel
PhD thesis, 1972


  Loading...