Luc Boasson

1.5k total citations
46 papers, 526 citations indexed

About

Luc Boasson is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Luc Boasson has authored 46 papers receiving a total of 526 indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Computational Theory and Mathematics, 26 papers in Artificial Intelligence and 15 papers in Molecular Biology. Recurrent topics in Luc Boasson's work include semigroups and automata theory (38 papers), DNA and Biological Computing (12 papers) and Advanced Algebra and Logic (12 papers). Luc Boasson is often cited by papers focused on semigroups and automata theory (38 papers), DNA and Biological Computing (12 papers) and Advanced Algebra and Logic (12 papers). Luc Boasson collaborates with scholars based in France, Russia and Italy. Luc Boasson's co-authors include Maurice Nivat, Jean Berstel, Géraud Sénizergues, Jean-Michel Autebert, Olivier Carton, Joffroy Beauquier, Irène Guessarian, Bruno Courcelle, Yuri Matiyasevich and Attilio Restivo and has published in prestigious journals such as SHILAP Revista de lepidopterología, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Luc Boasson

45 papers receiving 446 citations

Peers

Luc Boasson

CTM

AI

MB

GT

DMC

Matthias Jantzen Germany

Mikhail V. Volkov Russia

Jacques Sakarovitch France

Stefano Varricchio Italy

Christian Choffrut France

John Doner United States

Celia Wrathall United States

Antoni Mazurkiewicz Poland

H. J. Shyr Taiwan

Marcel Jackson Australia

Matthias Jantzen Germany

Luc Boasson

311 ×0.7

CTM

222 ×0.6

AI

121 ×0.8

MB

57 ×1.5

GT

15 ×0.6

DMC

Citations per year, relative to Luc Boasson Luc Boasson (= 1×) peers Matthias Jantzen

Countries citing papers authored by Luc Boasson

Since Specialization

Citations

This map shows the geographic impact of Luc Boasson'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 Luc Boasson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Luc Boasson more than expected).

Fields of papers citing papers by Luc Boasson

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Luc Boasson. 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 Luc Boasson. The network helps show where Luc Boasson may publish in the future.

Co-authorship network of co-authors of Luc Boasson

This figure shows the co-authorship network connecting the top 25 collaborators of Luc Boasson. A scholar is included among the top collaborators of Luc Boasson 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 Luc Boasson. Luc Boasson is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Carton, Olivier & Luc Boasson. (2020). Transfinite Lyndon words. SHILAP Revista de lepidopterología.

2.

Berstel, Jean, et al.. (2012). Splicing systems and the Chomsky hierarchy. Theoretical Computer Science. 436. 2–22. 9 indexed citations

3.

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

4.

Berstel, Jean, et al.. (2005). Operations preserving regular languages. Theoretical Computer Science. 354(3). 405–420. 7 indexed citations

5.

Berstel, Jean, Luc Boasson, & Michel Latteux. (2004). Mixed languages. Theoretical Computer Science. 332(1-3). 179–198. 1 indexed citations

6.

Berstel, Jean & Luc Boasson. (2002). Shuffle factorization is unique. Theoretical Computer Science. 273(1-2). 47–67. 9 indexed citations

7.

Berstel, Jean & Luc Boasson. (1999). Partial words and a theorem of Fine and Wilf. Theoretical Computer Science. 218(1). 135–141. 75 indexed citations

8.

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

9.

Autebert, Jean-Michel, Luc Boasson, & Géraud Sénizergues. (1987). Groups and nts languages. Journal of Computer and System Sciences. 35(2). 243–267. 18 indexed citations

10.

Boasson, Luc & Géraud Sénizergues. (1985). NTS languages are deterministic and congruential. Journal of Computer and System Sciences. 31(3). 332–342. 24 indexed citations

11.

Beauquier, Joffroy, et al.. (1984). Remarques sur les langages de parenthèses. Theoretical Computer Science. 31(3). 337–349. 3 indexed citations

12.

Autebert, Jean-Michel, Joffroy Beauquier, Luc Boasson, & Michel Latteux. (1982). Indécidabilité de la condition IRS. Springer Link (Chiba Institute of Technology). 16(2). 129–138. 1 indexed citations

13.

Boasson, Luc. (1980). Derivations et Redutions dans les Grammaires Algebriques. International Colloquium on Automata, Languages and Programming. 109–118. 2 indexed citations

14.

Boasson, Luc & Maurice Nivat. (1980). Adherences of languages. Journal of Computer and System Sciences. 20(3). 285–309. 83 indexed citations

15.

Autebert, Jean-Michel, Joffroy Beauquier, & Luc Boasson. (1980). Langages sur des alphabets infinis. Discrete Applied Mathematics. 2(1). 1–20. 11 indexed citations

16.

Autebert, Jean-Michel, et al.. (1978). A note on 1-locally linear languages. Information and Control. 37(1). 1–4. 6 indexed citations

17.

Boasson, Luc. (1973). Two iteration theorems for some families of languages. Journal of Computer and System Sciences. 7(6). 583–596. 23 indexed citations

18.

Boasson, Luc & Maurice Nivat. (1973). Sur diverses familles de langages ferm�es par transduction rationnelle. Acta Informatica. 2(2). 33 indexed citations

19.

Boasson, Luc. (1972). Un critère de rationnalité des langages algébriques.. International Colloquium on Automata, Languages and Programming. 359–365. 3 indexed citations

20.

Boasson, Luc & Maurice Nivat. (1971). Transductions et familles de langages. French digital mathematics library (Numdam). 35. 31–37. 2 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