Jean Berstel

According to our database1, Jean Berstel authored at least 80 papers between 1972 and 2013.

Collaborative distances:



In proceedings 
PhD thesis 





Lettre à Christophe Reutenauer.
IJAC, 2013

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

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

Splicing systems and the Chomsky hierarchy
CoRR, 2011

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

Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm.
Theor. Comput. Sci., 2009

Infinite words without palindrome
CoRR, 2009

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

ITA, 2008

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

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

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

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

Combinatorics on words: a tutorial.
Bulletin of the EATCS, 2003

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

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

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

Recent Results on Extensions of Sturmian Words.
IJAC, 2002

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

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

An Exercise on Fibonacci Representations.
ITA, 2001

A Scalable Formal Method for Design and Automatic Checking of User Interfaces.
Proceedings of the 23rd International Conference on Software Engineering, 2001

Formal Properties of XML Grammars and Languages
CoRR, 2000

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

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

A Note on List Languages.
IJAC, 1999

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

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.
Bulletin of the EATCS, 1997

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

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

Random generation of finite Sturmian words.
Discrete Mathematics, 1996

A relative of the Thue-Morse sequence.
Discrete Mathematics, 1995

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

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

A Remark on Morphic Sturmian Words.
ITA, 1994

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

A Geometric Proof of the Enumeration Formula for Sturmian Words.
IJAC, 1993

A Characterization of Overlap-Free Morphisms.
Discrete Applied Mathematics, 1993

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

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

Addition Chains Using Continued Fractions.
J. Algorithms, 1989

Langford strings are square free.
Bulletin of the EATCS, 1989

Thue-Morse sequence and p-adic topology for the free monoid.
Discrete Mathematics, 1989

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

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

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

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

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

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

More about the "Geography" of Context-Free Languages
Information and Control, May, 1981

More about the "Geography" of Context-Free Languages.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

Mots sans carre et morphismes iteres.
Discrete Mathematics, 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

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

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

Sur une Conjecture de S. Greibach.
Acta Inf., 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

Une Hiérarchie des Parties Rationelles de N².
Mathematical Systems Theory, 1973

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