| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jean Berstel, Luc Boasson, Isabelle Fagnot |
Splicing systems and the Chomsky hierarchy  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson, Olivier Carton, Jean-Eric Pin, Antonio Restivo |
The expressive power of the shuffle product.  |
Inf. Comput.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marie-Pierre Béal, Jean Berstel, S. Eilers, Dominique Perrin |
Symbolic dynamics  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot |
Minimization of Automata  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone |
Bifix codes and Sturmian words  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot |
Sturmian Trees.  |
Theory Comput. Syst.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson, Olivier Carton |
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm.  |
Theor. Comput. Sci.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot |
Infinite words without palindrome  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Jean Berstel, Christophe Reutenauer |
Another proof of Soittola's theorem.  |
Theor. Comput. Sci.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Christophe Reutenauer |
Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids.  |
Theor. Comput. Sci.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Tero Harju, Juhani Karhumäki |
Preface.  |
ITA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Dominique Perrin |
The origins of combinatorics on words.  |
Eur. J. Comb.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel |
Sturmian and Episturmian Words.  |
CAI  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot |
A First Investigation of Sturmian Trees.  |
STACS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin |
Operations preserving regular languages.  |
Theor. Comput. Sci.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Alessandra Savelli |
Crochemore Factorization of Sturmian and Other Infinite Words.  |
MFCS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson, Michel Latteux |
Mixed languages.  |
Theor. Comput. Sci.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel |
Growth of repetition-free words -- a review.  |
Theor. Comput. Sci.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
2005 |
DBLP DOI BibTeX RDF |
applications of model checking, Human-computer interaction (HCI), GUI design |
| 1 | Jean Berstel |
Review of "Automatic sequences: theory, applications, generalizations" by Jean-Paul Allouche and Jeffrey Shallit. Cambridge University Press.  |
SIGACT News  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Olivier Carton |
On the Complexity of Hopcroft's State Minimization Algorithm.  |
CIAA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Juhani Karhumäki |
Combinatorics on words: a tutorial.  |
Bulletin of the EATCS  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin |
Operations Preserving Recognizable Languages.  |
FCT  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Laurent Vuillon |
Coding rotations on intervals.  |
Theor. Comput. Sci.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson |
Shuffle factorization is unique.  |
Theor. Comput. Sci.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel |
Recent Results on Extensions of Sturmian Words.  |
IJAC  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson |
Formal properties of XML grammars and languages.  |
Acta Inf.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson |
Balanced Grammars and Their Languages.  |
Formal and Natural Computing ![In: Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002], pp. 3-25, 2002, Springer, 3-540-43190-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel |
An Exercise on Fibonacci Representations.  |
ITA  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, Pierluigi San Pietro |
A Scalable Formal Method for Design and Automatic Checking of User Interfaces.  |
ICSE  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson |
Formal Properties of XML Grammars and Languages  |
CoRR  |
2000 |
DBLP BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson |
XML Grammars.  |
MFCS  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson |
Partial Words and a Theorem of Fine and Wilf.  |
Theor. Comput. Sci.  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel |
On the Index of Sturmian Words.  |
Jewels are Forever  |
1999 |
DBLP BibTeX RDF |
|
| 1 | Jean Berstel, Aldo de Luca |
Sturmian Words, Lyndon Words and Trees.  |
Theor. Comput. Sci.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson |
The set of Lyndon words is not context-free.  |
Bulletin of the EATCS  |
1997 |
DBLP BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson |
The Set of Minimal Words of a Context-Free Language is Context-Free.  |
J. Comput. Syst. Sci.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Jean-Eric Pin |
Local Languages and the Berry-Sethi Algorithm.  |
Theor. Comput. Sci.  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Michel Pocchiola |
Random generation of finite Sturmian words.  |
Discrete Mathematics  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson |
Towards an Algebraic Theory of Context-Free Languages.  |
Fundam. Inform.  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Paul Allouche, André Arnold, Jean Berstel, Srecko Brlek, William Jockusch, Simon Plouffe, Bruce E. Sagan |
A relative of the Thue-Morse sequence.  |
Discrete Mathematics  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel |
Recent Results on Sturmian Words.  |
Developments in Language Theory  |
1995 |
DBLP BibTeX RDF |
|
| 1 | Jean Berstel, Michel Pocchiola |
Average Cost of Duval's Algorithm for Generating Lyndon Words.  |
Theor. Comput. Sci.  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Patrice Séébold |
A Remark on Morphic Sturmian Words.  |
ITA  |
1994 |
DBLP BibTeX RDF |
|
| 1 | Jean Berstel |
A Rewriting of Fife's Theorem about Overlap-Free Words.  |
Results and Trends in Theoretical Computer Science  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Patrice Séébold |
A Characterization of Overlap-Free Morphisms.  |
Discrete Applied Mathematics  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Patrice Séébold |
A Characterization of Sturmian Morphisms.  |
MFCS  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson |
Context-Free Languages.  |
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)  |
1990 |
DBLP BibTeX RDF |
|
| 1 | Jean Berstel, Maxime Crochemore, Jean-Eric Pin |
Thue-Morse sequence and p-adic topology for the free monoid.  |
Discrete Mathematics  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | François Bergeron, Jean Berstel, Srecko Brlek, Christine Duboc |
Addition Chains Using Continued Fractions.  |
J. Algorithms  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel |
Langford strings are square free.  |
Bulletin of the EATCS  |
1989 |
DBLP BibTeX RDF |
|
| 1 | Jean Berstel |
Properties of Infinite Words: Recent Result.  |
STACS  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Christophe Reutenauer |
Zeta Functions of Recognizable Languages.  |
ICALP  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel |
Finite automata and rational languages. An introduction.  |
Formal Properties of Finite Automata and Applications  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Srecko Brlek |
On the Length of Word Chains.  |
Inf. Process. Lett.  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel |
Every Iterated Morphism Yields a co-CFL.  |
Inf. Process. Lett.  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Jacques Sakarovitch |
Recent Results in the Theory of Rational Sets.  |
MFCS  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel |
Some Recent Results on Squarefree Words.  |
STACS  |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Christophe Reutenauer |
Recognizable Formal Power Series on Trees.  |
Theor. Comput. Sci.  |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Joffroy Beauquier, Jean Berstel |
More about the ``Geography'' of Context-Free Languages  |
Information and Control  |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Joffroy Beauquier, Jean Berstel |
More about the ``Geography'' of Context-Free Languages.  |
MFCS  |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Christophe Reutenauer |
Séries formelles reconnaissables d'arbres et applications.  |
CLAAP  |
1980 |
DBLP BibTeX RDF |
|
| 1 | Jean Berstel |
Sur les mots sans carré définis par un morphisme.  |
ICALP  |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel |
Some Recent Results on Recognizable Formal Power Series.  |
FCT  |
1977 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel |
Sur une Conjecture de S. Greibach.  |
Acta Inf.  |
1974 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel, Luc Boasson |
Une suite decroissante de cônes rationnels.  |
ICALP  |
1974 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel |
Une Hiérarchie des Parties Rationelles de N².  |
Mathematical Systems Theory  |
1973 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Berstel |
Contribution a l'etude des proprietes arithmetiques des langages formels.  |
|
1972 |
RDF |
|
| 1 | Jean Berstel |
Sur la densité asymptotique de langages formels.  |
ICALP  |
1972 |
DBLP BibTeX RDF |
|
| 1 | Jean Berstel |
On Sets of Numbers Recognized by Push-Down Automata  |
SWAT (FOCS)  |
1972 |
DBLP DOI BibTeX RDF |
|