Jean Berstel

Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone: Recent results on syntactic groups of prefix codes. Eur. J. Comb. 33(7): 1386-1401 (2012)

Jean Berstel, Luc Boasson, Isabelle Fagnot: Splicing systems and the Chomsky hierarchy. Theor. Comput. Sci. 436: 2-22 (2012)

Jean Berstel, Luc Boasson, Isabelle Fagnot: Splicing systems and the Chomsky hierarchy. CoRR abs/1102.0947 (2011)

Jean Berstel, Luc Boasson, Olivier Carton, Jean-Eric Pin, Antonio Restivo: The expressive power of the shuffle product. Inf. Comput. 208(11): 1258-1272 (2010)

Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot: Sturmian Trees. Theory Comput. Syst. 46(3): 443-478 (2010)

Marie-Pierre Béal, Jean Berstel, S. Eilers, Dominique Perrin: Symbolic dynamics. CoRR abs/1006.1265 (2010)

Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot: Minimization of Automata. CoRR abs/1010.5318 (2010)

Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone: Bifix codes and Sturmian words. CoRR abs/1011.5369 (2010)

Jean Berstel, Luc Boasson, Olivier Carton: Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm. Theor. Comput. Sci. 410(30-32): 2811-2822 (2009)

Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot: Infinite words without palindrome. CoRR abs/0903.2382 (2009)

Jean Berstel, Tero Harju, Juhani Karhumäki: Preface. ITA 42(4): 657 (2008)

Jean Berstel, Christophe Reutenauer: Another proof of Soittola's theorem. Theor. Comput. Sci. 393(1-3): 196-203 (2008)

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): 144-158 (2008)

Jean Berstel, Dominique Perrin: The origins of combinatorics on words. Eur. J. Comb. 28(3): 996-1022 (2007)

Jean Berstel: Sturmian and Episturmian Words. CAI 2007: 23-47

Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot: A First Investigation of Sturmian Trees. STACS 2007: 73-84

Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin: Operations preserving regular languages. Theor. Comput. Sci. 354(3): 405-420 (2006)

Jean Berstel, Alessandra Savelli: Crochemore Factorization of Sturmian and Other Infinite Words. MFCS 2006: 157-166

Jean Berstel, Luc Boasson, Michel Latteux: Mixed languages. Theor. Comput. Sci. 332(1-3): 179-198 (2005)

Jean Berstel: Growth of repetition-free words -- a review. Theor. Comput. Sci. 340(1): 280-290 (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): 124-167 (2005)

Jean Berstel: Review of "Automatic sequences: theory, applications, generalizations" by Jean-Paul Allouche and Jeffrey Shallit. Cambridge University Press. SIGACT News 35(1): 12-16 (2004)

Jean Berstel, Olivier Carton: On the Complexity of Hopcroft's State Minimization Algorithm. CIAA 2004: 35-44

Jean Berstel, Juhani Karhumäki: Combinatorics on words: a tutorial. Bulletin of the EATCS 79: 178- (2003)

Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin: Operations Preserving Recognizable Languages. FCT 2003: 343-354

Jean Berstel, Luc Boasson: Formal properties of XML grammars and languages. Acta Inf. 38(9): 649-671 (2002)

Jean Berstel: Recent Results on Extensions of Sturmian Words. IJAC 12(1-2): 371-385 (2002)

Jean Berstel, Luc Boasson: Shuffle factorization is unique. Theor. Comput. Sci. 273(1-2): 47-67 (2002)

Jean Berstel, Laurent Vuillon: Coding rotations on intervals. Theor. Comput. Sci. 281(1-2): 99-107 (2002)

Jean Berstel, Luc Boasson: Balanced Grammars and Their Languages. Formal and Natural Computing 2002: 3-25

Jean Berstel: An Exercise on Fibonacci Representations. ITA 35(6): 491-498 (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: 453-462

Jean Berstel, Luc Boasson: XML Grammars. MFCS 2000: 182-191

Jean Berstel, Luc Boasson: Formal Properties of XML Grammars and Languages. CoRR cs.DM/0011011 (2000)

Jean Berstel, Luc Boasson: A Note on List Languages. IJAC 9(3-4): 263-270 (1999)

Jean Berstel, Luc Boasson: Partial Words and a Theorem of Fine and Wilf. Theor. Comput. Sci. 218(1): 135-141 (1999)

Jean Berstel: On the Index of Sturmian Words. Jewels are Forever 1999: 287-294

Jean Berstel, Luc Boasson: The set of Lyndon words is not context-free. Bulletin of the EATCS 63 (1997)

Jean Berstel, Luc Boasson: The Set of Minimal Words of a Context-Free Language is Context-Free. J. Comput. Syst. Sci. 55(3): 477-488 (1997)

Jean Berstel, Aldo de Luca: Sturmian Words, Lyndon Words and Trees. Theor. Comput. Sci. 178(1-2): 171-203 (1997)

Jean Berstel, Michel Pocchiola: Random generation of finite Sturmian words. Discrete Mathematics 153(1-3): 29-39 (1996)

Jean Berstel, Luc Boasson: Towards an Algebraic Theory of Context-Free Languages. Fundam. Inform. 25(3): 217-239 (1996)

Jean Berstel, Jean-Eric Pin: Local Languages and the Berry-Sethi Algorithm. Theor. Comput. Sci. 155(2): 439-446 (1996)

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 139(1-3): 455-461 (1995)

Jean Berstel: Recent Results on Sturmian Words. Developments in Language Theory 1995: 13-24

Jean Berstel, Patrice Séébold: A Remark on Morphic Sturmian Words. ITA 28(3-4): 255-263 (1994)

Jean Berstel, Michel Pocchiola: Average Cost of Duval's Algorithm for Generating Lyndon Words. Theor. Comput. Sci. 132(2): 415-425 (1994)

Jean Berstel: A Rewriting of Fife's Theorem about Overlap-Free Words. Results and Trends in Theoretical Computer Science 1994: 19-29

Jean Berstel, Patrice Séébold: A Characterization of Overlap-Free Morphisms. Discrete Applied Mathematics 46(3): 275-281 (1993)

Jean Berstel, Patrice Séébold: A Characterization of Sturmian Morphisms. MFCS 1993: 281-290

Jean Berstel, Luc Boasson: Context-Free Languages. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 59-102

Jean Berstel, Maxime Crochemore, Jean-Eric Pin: Thue-Morse sequence and p-adic topology for the free monoid. Discrete Mathematics 76(2): 89-94 (1989)

Jean Berstel: Langford strings are square free. Bulletin of the EATCS 37: 127-128 (1989)

François Bergeron, Jean Berstel, Srecko Brlek, Christine Duboc: Addition Chains Using Continued Fractions. J. Algorithms 10(3): 403-412 (1989)

Jean Berstel: Properties of Infinite Words: Recent Result. STACS 1989: 36-46

Jean Berstel, Christophe Reutenauer: Zeta Functions of Recognizable Languages. ICALP 1988: 93-104

Jean Berstel: Finite automata and rational languages. An introduction. Formal Properties of Finite Automata and Applications 1988: 2-14

Jean Berstel, Srecko Brlek: On the Length of Word Chains. Inf. Process. Lett. 26(1): 23-28 (1987)

Jean Berstel: Every Iterated Morphism Yields a co-CFL. Inf. Process. Lett. 22(1): 7-9 (1986)

Jean Berstel, Jacques Sakarovitch: Recent Results in the Theory of Rational Sets. MFCS 1986: 15-28

Jean Berstel: Some Recent Results on Squarefree Words. STACS 1984: 14-25

Jean Berstel, Christophe Reutenauer: Recognizable Formal Power Series on Trees. Theor. Comput. Sci. 18: 115-148 (1982)

Joffroy Beauquier, Jean Berstel: More about the ``Geography'' of Context-Free Languages. Information and Control 49(2): 91-108 (1981)

Joffroy Beauquier, Jean Berstel: More about the ``Geography'' of Context-Free Languages. MFCS 1981: 183-192

Jean Berstel, Christophe Reutenauer: Séries formelles reconnaissables d'arbres et applications. CLAAP 1980: 11-21

Jean Berstel: Sur les mots sans carré définis par un morphisme. ICALP 1979: 16-25

Jean Berstel: Some Recent Results on Recognizable Formal Power Series. FCT 1977: 39-48

Jean Berstel: Sur une Conjecture de S. Greibach. Acta Inf. 3: 293-295 (1974)

Jean Berstel, Luc Boasson: Une suite decroissante de cônes rationnels. ICALP 1974: 383-397

Jean Berstel: Une Hiérarchie des Parties Rationelles de N². Mathematical Systems Theory 7(2): 114-137 (1973)

Jean Berstel: Contribution a l'etude des proprietes arithmetiques des langages formels. Univ. Paris VII 1972, pp. I-III, 1-131

Jean Berstel: On Sets of Numbers Recognized by Push-Down Automata. SWAT (FOCS) 1972: 200-206

Jean Berstel: Sur la densité asymptotique de langages formels. ICALP 1972: 345-358