Jean Berstel

6.2k total citations
57 papers, 1.7k citations indexed

About

Jean Berstel is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Jean Berstel has authored 57 papers receiving a total of 1.7k indexed citations (citations by other indexed papers that have themselves been cited), including 49 papers in Computational Theory and Mathematics, 33 papers in Artificial Intelligence and 18 papers in Molecular Biology. Recurrent topics in Jean Berstel's work include semigroups and automata theory (45 papers), DNA and Biological Computing (15 papers) and Algorithms and Data Compression (15 papers). Jean Berstel is often cited by papers focused on semigroups and automata theory (45 papers), DNA and Biological Computing (15 papers) and Algorithms and Data Compression (15 papers). Jean Berstel collaborates with scholars based in France, Canada and Italy. Jean Berstel's co-authors include Christophe Reutenauer, Dominique Perrin, Luc Boasson, Aldo de Luca, Michel Pocchiola, Maurice Mignotte, Srečko Brlek, Patrice Séébold, François Bergeron and Jean-Éric Pin and has published in prestigious journals such as Transactions of the American Mathematical Society, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Jean Berstel

55 papers receiving 1.6k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Jean Berstel France 20 1.4k 1.1k 429 178 156 57 1.7k
Dominique Perrin France 16 1.2k 0.9× 897 0.8× 435 1.0× 126 0.7× 129 0.8× 90 1.5k
Maurice Nivat France 25 1.8k 1.3× 1.6k 1.4× 220 0.5× 112 0.6× 117 0.8× 101 2.3k
Antonio Restivo Italy 19 919 0.7× 787 0.7× 493 1.1× 73 0.4× 47 0.3× 112 1.2k
Frank Ruskey Canada 21 681 0.5× 643 0.6× 126 0.3× 62 0.3× 85 0.5× 84 1.3k
M. P. Schützenberger France 21 1.4k 1.0× 1.0k 1.0× 333 0.8× 166 0.9× 314 2.0× 43 1.9k
Eugene M. Luks United States 20 792 0.6× 792 0.7× 86 0.2× 100 0.6× 312 2.0× 58 1.7k
Roman Smolensky United States 10 765 0.5× 649 0.6× 49 0.1× 92 0.5× 135 0.9× 17 1.2k
Karel Čulík Canada 21 1.0k 0.7× 553 0.5× 468 1.1× 200 1.1× 48 0.3× 105 1.3k
M. A. Tsfasman Russia 14 344 0.2× 969 0.9× 61 0.1× 158 0.9× 338 2.2× 33 1.3k
G. B. Preston United States 12 2.5k 1.8× 408 0.4× 201 0.5× 446 2.5× 846 5.4× 45 3.1k

Countries citing papers authored by Jean Berstel

Since Specialization
Citations

This map shows the geographic impact of Jean Berstel's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jean Berstel with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jean Berstel more than expected).

Fields of papers citing papers by Jean Berstel

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jean Berstel. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jean Berstel. The network helps show where Jean Berstel may publish in the future.

Co-authorship network of co-authors of Jean Berstel

This figure shows the co-authorship network connecting the top 25 collaborators of Jean Berstel. A scholar is included among the top collaborators of Jean Berstel based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jean Berstel. Jean Berstel is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Berstel, Jean, et al.. (2012). Splicing systems and the Chomsky hierarchy. Theoretical Computer Science. 436. 2–22. 9 indexed citations
2.
Berstel, Jean, Luc Boasson, & Olivier Carton. (2009). Continuant polynomials and worst-case behavior of Hopcroft’s minimization algorithm. Theoretical Computer Science. 410(30-32). 2811–2822. 9 indexed citations
3.
Berstel, Jean, Dominique Perrin, & Christophe Reutenauer. (2009). Codes and Automata (Encyclopedia of Mathematics and its Applications). Cambridge University Press eBooks. 634–634. 23 indexed citations
4.
Berstel, Jean, Aaron Lauve, Christophe Reutenauer, & Franco Saliola. (2008). Combinatorics on Words. 12 indexed citations
5.
Berstel, Jean & Christophe Reutenauer. (2008). 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. 1 indexed citations
6.
Berstel, Jean, et al.. (2005). Operations preserving regular languages. Theoretical Computer Science. 354(3). 405–420. 7 indexed citations
7.
Berstel, Jean, Luc Boasson, & Michel Latteux. (2004). Mixed languages. Theoretical Computer Science. 332(1-3). 179–198. 1 indexed citations
8.
Berstel, Jean & Luc Boasson. (2002). Shuffle factorization is unique. Theoretical Computer Science. 273(1-2). 47–67. 9 indexed citations
9.
Berstel, Jean & Luc Boasson. (1999). Partial words and a theorem of Fine and Wilf. Theoretical Computer Science. 218(1). 135–141. 75 indexed citations
10.
Berstel, Jean & Luc Boasson. (1997). The Set of Minimal Words of a Context-free Language is Context-free. Journal of Computer and System Sciences. 55(3). 477–488. 5 indexed citations
11.
Berstel, Jean & Aldo de Luca. (1997). Sturmian words, Lyndon words and trees. Theoretical Computer Science. 178(1-2). 171–203. 77 indexed citations
12.
Berstel, Jean & Jean-Éric Pin. (1996). Local languages and the Berry-Sethi algorithm. Theoretical Computer Science. 155(2). 439–446. 19 indexed citations
13.
Berstel, Jean & Michel Pocchiola. (1994). Average cost of Duval's algorithm for generating Lyndon words. Theoretical Computer Science. 132(1-2). 415–425. 13 indexed citations
14.
Berstel, Jean & Patrice Séébold. (1993). A characterization of overlap-free morphisms. Discrete Applied Mathematics. 46(3). 275–281. 17 indexed citations
15.
Berstel, Jean & Christophe Reutenauer. (1990). Zeta Functions of Formal Languages. Transactions of the American Mathematical Society. 321(2). 533–533. 1 indexed citations
16.
Berstel, Jean & Christophe Reutenauer. (1988). Rational Series and Their Languages. HAL (Le Centre pour la Communication Scientifique Directe). 364 indexed citations
17.
Berstel, Jean & Christophe Reutenauer. (1982). Recognizable formal power series on trees. Theoretical Computer Science. 18(2). 115–148. 81 indexed citations
18.
Berstel, Jean, et al.. (1981). More about the “geography” of context-free languages. Information and Control. 49(2). 91–108. 1 indexed citations
19.
Berstel, Jean. (1980). Mots sans carre et morphismes iteres. Discrete Mathematics. 29(3). 235–244. 22 indexed citations
20.
Berstel, Jean, et al.. (1979). Sur le théorème du défaut. Journal of Algebra. 60(1). 169–180. 27 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026