Publications Jean Berstel


DBLP Citeseer Bibtex IGM style Bibtex


[124] Jean Berstel, Luc Boasson, Isabelle Fagnot. Splicing systems and the Chomsky hierarchy. Theoretical Computer Science, 436:2-22, 2012
[123] Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Guiseppina Rindone. Bifix codes and Sturmian words. J. Algebra, 369:146-202, 2012
[122] 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.
[121] Marie-Pierre Béal, Jean Berstel, Brian H. Marcus, Dominique Perrin, Christophe Reutenauer, and Paul H. Siegel. Variable-length codes and finite automata. In I. Woungang, editor, Selected Topics in Information and Coding Theory. World Scientific, 2010.
[120] Jean Berstel, Luc Boasson, Olivier Carton, and Isabelle Fagnot. Sturmian trees. Theory of Computing Systems, 46(3):443-478, 2010. selected papers from STACS 2007.
[119] Jean Berstel, Dominique Perrin and Christophe Reutenauer. Codes and Automata, volume 129 of Encyclopedia of Mathematics and its Applications, Cambridge University Press, 2009. 634 pages.
[118] Jean Berstel, Luc Boasson, and Olivier Carton. Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm. Theoretical Computer Science, 410(30-32):2811-2822, 2009.
[117] Jean Berstel, Aaron Lauve, Christophe Reutenauer, and Franco Saliola. Combinatorics on Words: Christoffel Words and Repetition in Words, volume 27 of CRM monograph series. American Mathematical Society, 2008. 147 pages.
[116] Jean Berstel, Luc Boasson, and Olivier Carton. Hopcroft's automaton minimization algorithm and Sturmian words. In DMTCS'2008 (Fifth Colloquium on Mathematics and Computer Science, volume AI of DMTCS proceedings series, pages 355-366, 2008.
[115] Jean Berstel and Christophe Reutenauer. Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids. Theoretical Computer Science,400(1-3):144-158, 2008.
[114] Jean Berstel and Christophe Reutenauer. Another proof of Soittola's theorem. Theoretical Computer Science, 393(1-3):196-203, 2008.
[113] Jean Berstel. Sturmian and episturmian words (a survey of some recent results). In S. Bozapalidis and G. Rahonis, editors, CAI 2007,volume 4728 of Lecture Notes in Computer Science, pages 23-47. Springer-Verlag, 2007.
[112] Jean Berstel and Dominique Perrin. The origins of combinatorics on words. European J. Combin., 28(3):996-1022, 2007.
[111] Jean Berstel, Luc Boasson, Olivier Carton, and Isabelle Fagnot. A first investigation of Sturmian trees. In Wolfgang Thomas and Pascal Weil, editors, STACS'2007, volume 4393 of Lecture Notes in Computer Science, pages 73-84. Springer-Verlag, 2007.
[110] Jean Berstel and Luc Boasson. Modèles de machines. In Jacky Akoka and Isabelle Comyn-Wattiau, editors, Encyclopédie de l'informatique et des systèmes d'information, pages 987-998. Vuibert, 2006.
[109] Jean Berstel and Alessandra Savelli. Crochemore factorization of Sturmian and other infinite words. In Rastislav Kralovic and Pawel Urzyczyn, editors, Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, volume 4162 of Lecture Notes in Computer Science, pages 157-166. Springer-Verlag, 2006.
[108] Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, and Jean-Eric Pin. Operations preserving regular languages. Theor. Comput. Sci., 354(3):405-420, 2006.
[107] Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, and 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.
[106] Jean Berstel, Luc Boasson, and Michel Latteux. Mixed languages. Theor. Comput. Sci., 332(1-3):179-198, 2005.
[105] Jean Berstel. Growth of repetition-free words - a review. Theor. Comput. Sci., 340(1):280-290, 2005.
[104] M. Lothaire. Applied combinatorics on words, volume 105 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 2005. With a preface by Jean Berstel and Dominique Perrin.
[103] Jean Berstel and Dominique Perrin. Algorithms on words. In M. Lothaire, editor, Applied combinatorics on words, volume 105 of Encyclopedia of Mathematics and its Applications, chapter 1, pages 1-105. Cambridge University Press, 2005.
[102] Jean Berstel and Olivier Carton. On the complexity of Hopcroft's state minimization algorithm. In Michael Domaratzki, Alexander Okhotin, Kai Salomaa, and Sheng Yu, editors, Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers, volume 3317 of Lecture Notes in Computer Science, pages 35-44. Springer-Verlag, 2005.
[101] Jean Berstel, Juhani Karhumäki, and Dominique Perrin. Preface: Special issue on combinatorics on words. Internat. J. Found. Comput. Sci., 15(2):223-224, 2004.
[100] Jean Berstel and Juhani Karhumäki. Combinatorics on words-a tutorial. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 79:178-228, 2003.
[99] Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, and Jean-Éric Pin. Operations preserving recognizable languages. In Fundamentals of computation theory, volume 2751 of Lecture Notes in Computer Science, pages 343-354. Springer-Verlag, 2003.
[98] Jean Berstel and Luc Boasson. Balanced grammars and their languages. In Wilfried Brauer, Hartmut Ehring, Juhani Karhumäki, and Arto Salomaa, editors, Formal and Natural Computing, volume 2300 of Lecture Notes in Computer Science, pages 3-25. Springer-Verlag, 2002. Essays dedicated to Grzegorz Rozenberg.
[97] Jean Berstel and Luc Boasson. Formal properties of XML grammars and languages. Acta Inform., 38(9):649-671, 2002.
[96] Jean Berstel and Laurent Vuillon. Coding rotations on intervals. Theoret. Comput. Sci., 281(1-2):99-107, 2002. Selected papers in honour of Maurice Nivat.
[95] M. Lothaire. Algebraic combinatorics on words, volume 90 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 2002. With a preface by Jean Berstel and Dominique Perrin.
[94] Jean Berstel and Patrice Séébold. Sturmian words. In M. Lothaire, editor, Algebraic combinatorics on words, volume 90 of Encyclopedia of Mathematics and its Applications, chapter 2, pages 45-110. Cambridge University Press, 2002.
[93] Jean Berstel and Dominique Perrin. Finite and infinite words. In M. Lothaire, editor, Algebraic combinatorics on words, volume 90 of Encyclopedia of Mathematics and its Applications, chapter 1, pages 1-44. Cambridge University Press, 2002.
[92] Jean Berstel. Recent results on extensions of Sturmian words. Internat. J. Algebra Comput., 12(1-2):371-385, 2002. International Conference on Geometric and Combinatorial Methods in Group Theory and Semigroup Theory (Lincoln, NE, 2000).
[91] Jean Berstel and Luc Boasson. Shuffle factorization is unique . Theoret. Comput. Sci., 273(1-2):47-67, 2002. WORDS (Rouen, 1999).
[90] Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, and Pierluigi San Pietro. A scalable formal method for design and automatic checking of user interfaces. Proceedings of the 23rd international conference on Software engineering, pages 453-462. IEEE Computer Society, 2001.
[89] Jean Berstel. An exercise on Fibonacci representations. Theor. Inform. Appl., 35(6):491-498 (2002), 2001. A tribute to Aldo de Luca.
[88] Jean Berstel and Luc Boasson. XML grammars. In Mathematical foundations of computer science 2000 (Bratislava), volume 1893 of Lecture Notes in Computer Science, pages 182-191. Springer-Verlag, 2000.
[87] Jean Berstel and Luc Boasson. Partial words and a theorem of Fine and Wilf. Theoretical Computer Science, 218:135-141, 1999. WORDS (Rouen, 1997).
[86] Jean Berstel. On the index of Sturmian words. In Juhani Karhumäki, Hermann A. Maurer, Gheorghe Paun, and Grzegorz Rozenberg, editors, Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pages 287-294. Springer-Verlag, 1999.
[85] Jean Berstel and Luc Boasson. A note on list languages. Internat. J. Algebra Comput., 9(3-4):263-270, 1999. Dedicated to the memory of Marcel-Paul Schützenberger.
[84] Jean Berstel and Aldo De Luca. Sturmian words, Lyndon words and trees . Theoretical Computer Science, 178:171-203, 1997.
[83] Jean-Michel Autebert, Jean Berstel, and Luc Boasson. Context-free languages and push-down automata. In G. Rozenberg and A. Salomaa, editors, HandBook of Formal Languages, volume 1, pages 111-174. Springer-Verlag, 1997.
[82] Jean Berstel and Luc Boasson. The set of minimal words of a context-free language is context-free . J. Comput. System Sci., 55:139-140, 1997.
[81] Jean Berstel and Luc Boasson. The set of Lyndon words is not context-free. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 63:139-140, 1997.
[80] Jean Berstel and Jean-Éric Pin. Local languages and the Berry-Sethi algorithm. Theoretical Computer Science, 155:439-446, 1996.
[79] Jean Berstel. Recent results on Sturmian words. In J. Dassow, G. Rozenberg, and A. Salomaa, editors, Developments in Language Theory II (Magdeburg, 1995), pages 13-24. World Scientific, 1996.
[78] Jean Berstel and Luc Boasson. Towards an algebraic theory of context-free languages. Fundamentae Informaticae, 25(3):217-239, 1996.
[77] Jean Berstel and Michel Pocchiola. Random generation of finite Sturmian words. In Proceedings of the 5th Conference on Formal Power Series and Algebraic Combinatorics (Florence, 1993), Discrete Math., 153: 29-39, 1996.
[76] Jean-Paul Allouche, André Arnold, Jean Berstel, Srecko Brlek, William Jockusch, Simon Plouffe, and Bruce Sagan. A relative of the Thue-Morse sequence. Discrete Math., 139:455-461, 1995.
[75] Jean Berstel. Axel Thue's papers on repetitions in words: a translation . Publications du LaCIM 20, Université du Québec à Montréal, 1995. 85 pages.
[74] François Bergeron, Jean Berstel, and Srecko Brlek. Efficient computation of addition chains. . J. Théorie des Nombres de Bordeaux, 6:21-38, 1994.
[73] Jean Berstel and Michel Pocchiola. Average cost of Duval's algorithm for generating Lyndon words . Theoret. Comput. Sci., 132(1-2):415-425, 1994.
[72] Jean Berstel. A rewriting of Fife's theorem about overlap-free words . In J. Karhumäki, H. A. Maurer, and G. Rozenberg, editors, Results and Trends in Theoretical Computer Science, Colloquium in Honor of Arto Salomaa, Graz, Austria, June 10-11, 1994, Proceedings , volume 812 of Lecture Notes in Computer Science , pages 19-29. Springer-Verlag, 1994.
[71] Jean Berstel and Patrice Séébold. Morphismes de Sturm. Bull. Belg. Math. Soc. Simon Stevin, 1(2):175-189, 1994. Journées Montoises (Mons, 1992).
[70] Jean Berstel and Patrice Séébold. A remark on morphic Sturmian words. RAIRO Inform. Théor. Appl., 28(3-4):255-263, 1994.
[69] Jean Berstel and Michel Pocchiola. Géométrie algorithmique. Courrier du CNRS, La Recherche en Informatique, 80:58-59, 1993.
[68] Jean Berstel and Michel Pocchiola. A geometric proof of the enumeration formula for Sturmian words. Internat. J. Algebra Comput. 3:349-355, 1993.
[67] Jean Berstel and Patrice Séébold. A characterization of Sturmian morphisms . In Mathematical Foundations of Computer Science 1993 (Gdansk, 1993), volume 711 of Lecture Notes in Computer Science, pages 281-290. Springer-Verlag, 1993.
[66] Jean Berstel and Patrice Séébold. A characterization of overlap-free morphisms. Discrete Appl. Math., 46:275-281, 1993.
[65] Jean Berstel. Axel Thue's work on repetitions in words . In P. Leroux and C. Reutenauer, editors, Séries formelles et combinatoire algébrique, number 11 in Publications du LaCIM, pages 65-80, Université du Québec à Montréal, 1992.
[64] Danièle Beauquier, Jean Berstel, and Philippe Chrétienne. Éléments d'algorithmique. Masson, 1992. 463 pages.
[63] Jean Berstel, Jean-Éric Pin, and Michel Pocchiola. Mathématiques et informatique : problèmes résolus. McGraw-Hill France, 1991. 2 volumes.
[62] Jean Berstel. Tracé de droites, fractions continues et morphismes itérés. In M. Lothaire, editor, Mots, Langue, Raisonnement, Calcul, pages 298-309. Hermès, Paris, 1990. Mélanges offerts à M. P.-Schützenberger.
[61] Jean Berstel and Luc Boasson. Context-free languages . In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 59-102. Elsevier, 1990.
[60] Jean Berstel and Christophe Reutenauer. Zeta functions of formal languages. Trans. Amer. Math. Soc., 321(2):533-546, 1990.
[59] Jean Berstel. Langford strings are squarefree. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 127-129, 1989.
[58] Jean Berstel and Areski Nait Abdallah. Tétrarbres engendrés par des automates finis. In Journées GROPLAN ``Langages et algorithmes de l'informatique graphique'', volume 61-62 of Bigre+Globule, pages 167-175, 1989.
[57] Jean Berstel and Michelle Morcrette. Compact representation of patterns by finite automata. In PIXIM '89, pages 387-402, Paris, 1989. Hermès.
[56] Jean Berstel. Finite automata and rational languages: an introduction . In J.-É. Pin, editor, Formal properties of finite automata and applications (Ramatuelle, 1988) , volume 386 of Lecture Notes in Comput. Sci., pages 2-14. Springer-Verlag, 1989.
[55] Jean Berstel. Properties of infinite words: recent results . In STACS 89 (Paderborn, 1989), volume 349 of Lecture Notes in Comput. Sci., pages 36-46. Springer-Verlag, 1989.
[54] François Bergeron, Jean Berstel, Srecko Brlek, and Christine Duboc. Addition chains using continued fractions . J. Algorithms, 10(3):403-412, 1989.
[53] J. Berstel, M. Crochemore, and J.-E. Pin. Thue-Morse sequence and p-adic topology for the free monoid . Discrete Math., 76(2):89-94, 1989.
[52] Jean Berstel and Christophe Reutenauer. Zeta functions of recognizable languages . In Automata, languages and programming (Tampere, 1988) , volume 317 of Lecture Notes in Comput. Sci. , pages 93-104. Springer-Verlag, 1988.
[51] Jean Berstel and Christophe Reutenauer. Rational series and their languages , volume 12 of EATCS Monographs on Theoretical Computer Science . Springer-Verlag, 1988.
[50] Jean Berstel and Srecko Brlek. On the length of word chains . Inform. Process. Lett. , 26(1):23-28, 1987.
[49] Jean Berstel and Dominique Perrin. Trends in the theory of codes. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 29:84-95, 1986.
[48] Jean Berstel. Every iterated morphism yields a co-CFL . Inform. Process. Lett. , 22(1):7-9, 1986.
[47] Jean Berstel and Jacques Sakarovitch. Recent results in the theory of rational sets . In Mathematical Foundations of Computer Science, 1986 (Bratislava, 1986) , volume 233 of Lecture Notes in Comput. Sci., pages 15-28. Springer-Verlag, 1986.
[46] Jean Berstel and Jean-François Perrot. Multics, guide de l'usager. Masson, Paris, 1986.
[45] Jean Berstel. The construction of finite biprefix codes,. In J. Avenhaus and K. Madlener, editors, Combinatorial Algorithms in Algebraic Structures, pages 20-35. Universität Kaiserslautern, 1985.
[44] Jean Berstel. Fibonacci words, a survey. In G. Rozenberg and A. Salomaa, editors, The Book of L, pages 11-25. Springer-Verlag, 1985.
[43] Jean Berstel. Some recent results on squarefree words. In Proceedings of the conference on infinitistic mathematics (Lyon, 1984), volume 85 of Publ. Dép. Math. Nouvelle Sér. B, pages 21-36, Lyon, 1985. Univ. Claude-Bernard.
[42] Jean Berstel and Dominique Perrin. Theory of Codes, volume 117 of Pure and Applied Mathematics. Academic Press, 1985.
[41] Jean Berstel. Mots infinis. In Avignon conference on language theory and algorithmic complexity (Avignon, 1983), volume 84 of Publ. Dép. Math. Nouvelle Sér. B, pages 89-102. Univ. Claude-Bernard, Lyon, 1984.
[40] Jean Berstel. Wörter ohne Wiederholungen. In R. König, editor, 10ième Séminaire Lotharingien de combinatoire, pages 5-29, 1984.
[39] Jean Berstel. Some recent results on squarefree words . In M. Fontet and K. Mehlhorn, editors, STACS 84 (Paris, 1984), volume 166 of Lecture Notes in Comput. Sci. , pages 14-25. Springer-Verlag, 1984.
[38] Jean Berstel and Christophe Reutenauer. Les séries rationnelles et leurs langages. Études et Recherches en Informatique. [Studies and Research in Computer Science]. Masson, Paris, 1984.
[37] Jean Berstel and Christophe Reutenauer. Square-free words and idempotent semigroups. In M. Lothaire, editor, Combinatorics on Words, volume 17 of Encyclopedia of Mathematics and its Applications, pages 18-38. Addison-Wesley, 1983.
[36] Jean Berstel and Dominique Perrin. Codes circulaires. In L. J. Cummings, editor, Combinatorics on Words, Progress and Perspectives (Waterloo, Ont., 1982), pages 133-165. Academic Press, 1983.
[35] Jean Berstel and Christophe Reutenauer. Recognizable formal power series on trees . Theoret. Comput. Sci., 18(2):115-148, 1982.
[34] Jean Berstel. Fonctions rationnelles et addition . In M. Blab, editor, Théorie des Langages, École de printemps d'informatique théorique, pages 177-183. LITP, 1982.
[33] Jeoffroy Beauquier and Jean Berstel. More about the ``geography'' of context-free languages. Inform. and Control, 49(2):91-108, 1981.
[32] Jeoffroy Beauquier and Jean Berstel. More about the ``geography'' of context-free languages. In Mathematical Foundations of Computer Science (Strbské Pleso, 1981), volume 118 of Lecture Notes in Comput. Sci., pages 183-192. Springer, 1981.
[31] Jean Berstel and Christophe Reutenauer. Séries formelles reconnaissables d'arbres et applications. In Trees in algebra and programming (Proc. 5th Lille Colloq., Lille, 1980), pages 11-21. Univ. Lille I, Lille, 1980.
[30] Jean Berstel. Mots sans carré et morphismes itérés . Discrete Math., 29(3):235-244, 1980.
[29] Jean Berstel. Mots de Fibonacci. In Séminaire d'Informatique Théorique, pages 57-78, Paris, 1980-1981.
[28] Jean Berstel. Transductions and Context-Free Languages. Teubner Verlag, 1979.
[27] Jean Berstel. Sur les mots sans carré définis par un morphisme . In H. A. Maurer, editor, Automata, languages and programming (Sixth Colloq., Graz, 1979) , volume 71 of Lecture Notes in Comput. Sci., pages 16-25. Springer-Verlag, 1979.
[26] Jean Berstel. Sur la construction de mots sans carré. In Séminaire de Théorie des Nombres, 1978-1979, pages Exp. No. 18, 15. CNRS, Talence, 1979.
[25] Jean Berstel, Dominique Perrin, Jean-François Perrot, and Antonio Restivo. Sur le théorème du défaut . J. Algebra, 60(1):169-180, 1979.
[24] Jean Berstel. Mémento sur les transductions rationnelles. In J.-P. Crestin and M. Nivat, editors, Langages algébriques, École de printemps d'informatique théorique, Bonascre, 1973), pages 5-22. École Nat. Sup. Tech. Avancées, Paris, 1978.
[23] Jean Berstel. Ensembles reconnaissables de nombres. In J.-P. Crestin and M. Nivat, editors, Langages algébriques, École de printemps d'informatique théorique Bonascre, 1973), pages 23-84. École Nat. Sup. Tech. Avancées, Paris, 1978.
[22] Jean Berstel. Séries rationnelles. In Séries formelles en variables non commutatives et applications (Proc. 5e École de Printemps Informat. Théorique, Vieux-Boucau les Bains, 1977), pages 5-22. École Nat. Sup. Tech. Avancées, Paris, 1978.
[21] Jean Berstel. Some recent results on recognizable formal power series . In M. Karpinski, editor, Fundamentals of Computation Theory (Proc. Internat. Conf., Poznan-Kórnik, 1977) , volume 56 of Lecture Notes in Comput. Sci., pages 39-48. Springer-Verlag, 1977.
[20] Jean Berstel. Factorisation de fractions rationnelles et de suites récurrentes . Acta Arith., 30(1):5-17, 1976/77.
[19] Jean Berstel. ARCO, pour la programmation arithmétique et combinatoire. Mémoires de la Société Mathématique de France, 49-50:11-13, 1977.
[18] Jean Berstel. Congruences plus que parfaites et langages algébriques . Séminaire d'Informatique Théorique, pages 123-147, 1977.
[17] Jean Berstel and Maurice Mignotte. Deux propriétés décidables des suites récurrentes linéaires . Bull. Soc. Math. France, 104(2):175-184, 1976.
[16] Jean Berstel and Mogens Nielsen. The growth range equivalence problem for DOL systems is decidable. In A. Lindenmayer and G. Rozenberg, editors, Automata, Languages, Development, pages 161-178. North-Holland, Amsterdam, 1976.
[15] Jean Berstel. Complexité de quelques algorithmes de théorie des graphes. In R. Cori and J.-C. Bermond, editors, Journées de Combinatoire et Informatique, pages 31-40, Bordeaux, 1975.
[14] Jean Berstel. Sur une conjecture de S. Greibach. Acta Informat., 3:293-295, 1973/74.
[13] J. Berstel and L. Boasson. Une suite décroissante de cônes rationnels. In Jacques Loeckx, editor, Automata, languages and programming (Second Colloq., Univ. Saarbrücken, 1974), volume 14 of Lecture Notes in Comput. Sci., pages 383-397. Springer-Verlag, 1974.
[12] Jean Berstel. Sur la densité asymptotique de langages formels .. In Automata, languages and programming (Proc. Sympos., Rocquencourt, 1972), pages 345-358. North-Holland, Amsterdam, 1973.
[11] Jean Berstel. Une hiérarchie des parties rationnelles de N2 . Math. Systems Theory, 7:114-137, 1973.
[9] Jean Berstel. On sets of numbers recognized by push-down automata. In 13th Annual Symposium on Switching and Automata Theory (SWAT), pages 200-206, The University of Maryland, 25-27 October 1972. IEEE.
[8] Jean Berstel. Sur les pôles et le quotient de Hadamard de séries N-rationnelles. C. R. Acad. Sci. Paris Sér. A-B, 272:A1079-A1081, 1971.
[7] Jean Berstel. Die asymptotische Dichte formaler Sprachen. In W. Händler, G. Hotz, and H. Langmaack, editors, Tagung über formale Sprachen und Programmiersprachen, number 17 in Mitteilungen der GMD, pages 9-13, 1971.
[6] Jean Berstel. Sur des fractions rationnelles particulières . In Séminaire M. P. Schützenberger, A. Lentin et M. Nivat, 1969/70: Problèmes Mathématiques de la Théorie des Automates , 9 pages Exp. 2. Secrétariat mathématique, Paris, 1970.
[5] Jean Berstel. Sur des fractions rationnelles particulières. C. R. Acad. Sci. Paris Sér. A-B, 270:A304-A306, 1970.
[4] Jean Berstel. Zur Klassifizierung von Sprachen durch rationale Transduktionen. In G. Hotz and C.-P. Schnorr, editors, Tagung über formale Sprachen, number 8 in Mitteilungen der GMD, pages 1-6, 1970.
[3] Jean Berstel. Une application d'un théorème de Mahler aux propriétés arithmétiques des coefficients des séries rationnelles. C. R. Acad. Sci. Paris Sér. A-B, 266:A693-A695, 1968.
[2] Jean Berstel. Anwendung von Automatennetzen in der Graphentheorie. In 4. Colloquium über Automatentheorie, pages 1-8, Munich, octobre 1967.
[1] Jean Berstel. Résolution, par un réseau d'automates, du problème des arborescences dans un graphe. C. R. Acad. Sci. Paris Sér. A-B, 264:A388-A390, 1967.