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.
Proceedings of the Handbook of Automata Theory., 2021

Symbolic dynamics.
Proceedings of the Handbook of Automata Theory., 2021

2013
Lettre à Christophe Reutenauer.
Int. J. Algebra Comput., 2013

2012
Splicing systems and the Chomsky hierarchy.
Theor. Comput. Sci., 2012

Recent results on syntactic groups of prefix codes.
Eur. J. Comb., 2012

2010
Sturmian Trees.
Theory Comput. Syst., 2010

The expressive power of the shuffle product.
Inf. Comput., 2010

Bifix codes and Sturmian words
CoRR, 2010

Minimization of Automata
CoRR, 2010

Symbolic dynamics
CoRR, 2010

Codes and Automata.
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.
Theor. Comput. Sci., 2009

Infinite words without palindrome
CoRR, 2009

2008
Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids.
Theor. Comput. Sci., 2008

Another proof of Soittola's theorem.
Theor. Comput. Sci., 2008

Preface.
RAIRO Theor. Informatics Appl., 2008

2007
The origins of combinatorics on words.
Eur. J. Comb., 2007

A First Investigation of Sturmian Trees.
Proceedings of the STACS 2007, 2007

Sturmian and Episturmian Words.
Proceedings of the Algebraic Informatics, Second International Conference, 2007

2006
Operations preserving regular languages.
Theor. Comput. Sci., 2006

Crochemore Factorization of Sturmian and Other Infinite Words.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005
A scalable formal method for design and automatic checking of user interfaces.
ACM Trans. Softw. Eng. Methodol., 2005

Mixed languages.
Theor. Comput. Sci., 2005

Growth of repetition-free words -- a review.
Theor. Comput. Sci., 2005

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

On the Complexity of Hopcroft's State Minimization Algorithm.
Proceedings of the Implementation and Application of Automata, 2004

2003
Combinatorics on words: a tutorial.
Bull. EATCS, 2003

Operations Preserving Recognizable Languages.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002
Coding rotations on intervals.
Theor. Comput. Sci., 2002

Shuffle factorization is unique.
Theor. Comput. Sci., 2002

Recent Results on Extensions of Sturmian Words.
Int. J. Algebra Comput., 2002

Formal properties of XML grammars and languages.
Acta Informatica, 2002

Balanced Grammars and Their Languages.
Proceedings of the Formal and Natural Computing, 2002

2001
An Exercise on Fibonacci Representations.
RAIRO Theor. Informatics Appl., 2001

2000
XML Grammars.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999
Partial Words and a Theorem of Fine and Wilf.
Theor. Comput. Sci., 1999

A Note on List Languages.
Int. J. Algebra Comput., 1999

On the Index of Sturmian Words.
Proceedings of the Jewels are Forever, 1999

1997
Context-Free Languages and Pushdown Automata.
Proceedings of the Handbook of Formal Languages, Volume 1: Word, Language, Grammar., 1997

Sturmian Words, Lyndon Words and Trees.
Theor. Comput. Sci., 1997

The Set of Minimal Words of a Context-Free Language is Context-Free.
J. Comput. Syst. Sci., 1997

The set of Lyndon words is not context-free.
Bull. EATCS, 1997

1996
Local Languages and the Berry-Sethi Algorithm.
Theor. Comput. Sci., 1996

Towards an Algebraic Theory of Context-Free Languages.
Fundam. Informaticae, 1996

Random generation of finite Sturmian words.
Discret. Math., 1996

1995
A relative of the Thue-Morse sequence.
Discret. Math., 1995

Recent Results on Sturmian Words.
Proceedings of the Developments in Language Theory II, 1995

1994
Average Cost of Duval's Algorithm for Generating Lyndon Words.
Theor. Comput. Sci., 1994

A Remark on Morphic Sturmian Words.
RAIRO Theor. Informatics Appl., 1994

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

1993
A Geometric Proof of the Enumeration Formula for Sturmian Words.
Int. J. Algebra Comput., 1993

A Characterization of Overlap-Free Morphisms.
Discret. Appl. Math., 1993

A Characterization of Sturmian Morphisms.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1990
Context-Free Languages.
Proceedings of the Handbook of Theoretical Computer Science, 1990

1989
Addition Chains Using Continued Fractions.
J. Algorithms, 1989

Langford strings are square free.
Bull. EATCS, 1989

Thue-Morse sequence and p-adic topology for the free monoid.
Discret. Math., 1989

Properties of Infinite Words: Recent Result.
Proceedings of the STACS 89, 1989

1988
Finite automata and rational languages. An introduction.
Proceedings of the Formal Properties of Finite Automata and Applications, 1988

Zeta Functions of Recognizable Languages.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

Rational series and their languages.
EATCS monographs on theoretical computer science 12, Springer, ISBN: 0387186263, 1988

1987
On the Length of Word Chains.
Inf. Process. Lett., 1987

1986
Every Iterated Morphism Yields a co-CFL.
Inf. Process. Lett., 1986

Recent Results in the Theory of Rational Sets.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1984
Some Recent Results on Squarefree Words.
Proceedings of the STACS 84, 1984

1982
Recognizable Formal Power Series on Trees.
Theor. Comput. Sci., 1982

1981
More about the "Geography" of Context-Free Languages
Inf. Control., May, 1981

1980
Mots sans carre et morphismes iteres.
Discret. Math., 1980

Séries formelles reconnaissables d'arbres et applications.
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.
Proceedings of the Automata, 1979

Transductions and context-free languages.
Teubner Studienbücher : Informatik 38, Teubner, ISBN: 3519023407, 1979

1977
Some Recent Results on Recognizable Formal Power Series.
Proceedings of the Fundamentals of Computation Theory, 1977

1975
The Growth Range Equivalence Problem for DOL Systems is Decidable.
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.
Acta Informatica, 1974

Une suite decroissante de cônes rationnels.
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².
Math. Syst. Theory, 1973

1972
Sur la densité asymptotique de langages formels.
Proceedings of the Automata, 1972

On Sets of Numbers Recognized by Push-Down Automata
Proceedings of the 13th Annual Symposium on Switching and Automata Theory, 1972

Contribution a l'etude des proprietes arithmetiques des langages formels.
PhD thesis, 1972


  Loading...