Dominique Perrin
#21,906
Most Influential Person Now
French mathematician and theoretical computer scientist
Dominique Perrin's AcademicInfluence.com Rankings
Dominique Perrincomputer-science Degrees
Computer Science
#1954
World Rank
#2030
Historical Rank
Theoretical Computer Science
#39
World Rank
#39
Historical Rank
Dominique Perrinmathematics Degrees
Mathematics
#1670
World Rank
#2686
Historical Rank
Number Theory
#236
World Rank
#301
Historical Rank
Measure Theory
#2034
World Rank
#2467
Historical Rank
Download Badge
Computer Science Mathematics
Dominique Perrin's Degrees
- PhD Mathematics Paris-Saclay University
Why Is Dominique Perrin Influential?
(Suggest an Edit or Addition)According to Wikipedia, Dominique Pierre Perrin is a French mathematician and theoretical computer scientist known for his contributions to coding theory and to combinatorics on words. He is a professor of the University of Marne-la-Vallée and currently serves as the President of ESIEE Paris.
Dominique Perrin's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Finite Automata (1958) (707)
- Theory of codes (1985) (505)
- Infinite words - automata, semigroups, logic and games (2004) (370)
- The origins of combinatorics on words (2007) (172)
- Two-way string-matching (1991) (164)
- First-Order Logic and Star-Free Sets (1986) (134)
- Codes and Automata (2009) (106)
- On the Expressive Power of Temporal Logic (1993) (96)
- Codes and Automata (Encyclopedia of Mathematics and its Applications) (2009) (89)
- Symbolic Dynamics and Finite Automata (1997) (77)
- Recent Results on Automata and Infinite Words (1984) (73)
- Symbolic dynamics (2010) (73)
- Acyclic, connected and tree sets (2013) (56)
- Electronic Dictionaries and Automata in Computational Linguistics (1987) (55)
- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (2009) (49)
- Bifix codes and Sturmian words (2010) (46)
- Recurrent sets (2014) (46)
- A note on the Burrows-Wheeler transformation (2005) (44)
- Semigroups and automata on infinite words (2007) (43)
- Words over a Partially Commutative Alphabet (1985) (43)
- Maximal bifix decoding (2013) (42)
- Automata on Infinite Words (1985) (39)
- Chains and Superchains for ω-Rational Sets, Automata and Semigroups (1997) (38)
- The finite index basis property (2013) (34)
- Bifix codes and interval exchanges (2014) (30)
- Compression and Entropy (1992) (29)
- A note on the Burrows - CWheeler transformation (2005) (29)
- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (2011) (27)
- Profinite Semigroups and Symbolic Dynamics (2020) (26)
- Unavoidable Sets of Constant Length (2004) (24)
- Surjective Extensions of Sliding-Block Codes (1993) (23)
- An introduction to finite automata on infinite words (1984) (22)
- On the generating sequences of regular languages on k symbols (2003) (20)
- Completing Biprefix Codes (1982) (20)
- Neutral and tree sets of arbitrary characteristic (2017) (20)
- Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories (1986) (20)
- A conjecture on sets of differences of integer pairs (1981) (18)
- Rational Probability Measures (1989) (18)
- Profinite semigroups (2017) (17)
- Automata and semigroups recognizing infinite words (2008) (17)
- Variable-length codes and finite automata (2010) (15)
- On Positive Matrices (1992) (15)
- Unambiguous Automata (2008) (15)
- Synchronization and simplification (1979) (14)
- On the solution of Ehrenfeucht's conjecture (1985) (14)
- Specular sets (2015) (14)
- ON THE DIMENSION GROUP OF UNIMODULAR S-ADIC SUBSHIFTS (2019) (13)
- A quadratic algorithm for road coloring (2008) (13)
- The Wagner Hierarchy (1999) (13)
- Automata and formal languages (2003) (13)
- Rigidity and Substitutive Dendric Words (2018) (12)
- A hierarchy of shift equivalent sofic shifts (2005) (11)
- Return words of linear involutions and fundamental groups (2014) (11)
- Dimension Groups and Dynamical Systems (2020) (11)
- Completely Reducible Sets (2012) (11)
- Eventually dendric shift spaces (2020) (11)
- Parsing with a finite dictionary (2005) (11)
- Finite and infinite words (2002) (11)
- Codes, unambiguous automata and sofic systems (2006) (11)
- Codeterministic Automata on Infinite Words (1985) (11)
- A note on Sturmian words (2012) (10)
- Factorizing the polynomial of a code (1984) (9)
- Equations in Words (1989) (9)
- Generating Functions of Timed Languages (2012) (9)
- On syntactic groups (2003) (9)
- Enumerative Sequences of Leaves and Nodes in Rational Trees (1999) (9)
- Enumerative Sequences of Leaves in Rational Trees (1997) (9)
- The Syntactic Graph of a Sofic Shift Is Invariant under Shift Equivalence (2006) (9)
- Toward a Timed Theory of Channel Coding (2012) (8)
- Local Maps (1986) (8)
- A Finite State Version of the Kraft--McMillan Theorem (2000) (8)
- Eventually Dendric Shifts (2019) (8)
- Maximal Bifix Codes (1999) (8)
- Hall sets, Lazard sets and comma-free codes (2016) (7)
- Enumerative combinatorics on words (2001) (7)
- Interval exchanges, admissibility and branching Rauzy induction (2013) (7)
- Super-State Automata and Rational Trees (1998) (7)
- A conjecture on rational sequences (1990) (7)
- Recent results on syntactic groups of prefix codes (2012) (6)
- On the expressive power of temporal logic for finite words (1993) (6)
- Length Distributions and Regular Sequences (2001) (6)
- Combinatorics on words (1981) (6)
- Codes and sofic constraints (2005) (6)
- On the group of a rational maximal bifix code (2018) (5)
- Natural coding of linear involutions (2014) (5)
- Enumeration Formulæ in Neutral Sets (2015) (5)
- Recognizability of morphisms (2021) (5)
- Complete Codes in a Sofic Shift (2006) (5)
- A graph covering construction of all the finite complete biprefix codes (1981) (4)
- Two-sided Rauzy induction (2013) (4)
- Embeddings of local automata (2008) (4)
- A weak equivalence between shifts of finite type (2002) (4)
- Corrigendum to "On the theorem of Fredricksen and Maiorana about de Bruijn sequences" [Adv. in Appl. Math. 33 (2) (2004) 413-415] (2015) (4)
- Electronic Dictionaries and Automata in Computational Linguistics, LITP Spring School on Theoretical Computer Science, Saint-Pierre d'Oléron, France, May 25-29, 1987, Proceedings (1989) (4)
- The Wadge-Wagner Hierarchy of omega-Rational Sets (1997) (4)
- The Syntactic Graph of a Sofic Shift (2004) (4)
- Return Words and Bifix Codes in Eventually Dendric Sets (2019) (3)
- The Characteristic Polynomial of a Finite Automaton (1976) (3)
- On the groups of codes with empty kernel (2010) (3)
- Codes and Bernoulli partitions (1983) (3)
- Eventually dendric subshifts. (2018) (3)
- Combinatorics on words: Words (1997) (3)
- Decidable problems in substitution shifts (2021) (3)
- Completing codes in a sofic shift (2009) (3)
- Recurrent and birecurrent sets (2017) (2)
- On the Enumerative Sequences of Regular Languages on k Symbols (2002) (2)
- Unambiguously coded systems (2021) (2)
- On the dimension group of unimodular $${\mathcal {S}}$$-adic subshifts (2021) (2)
- Pelvic abscess associated with Haemophilus influenzae bacteremia (2009) (2)
- SEMIGROUPS AND AUTOMATA ON INFINITE (1995) (2)
- A Hierarchy of Irreducible Sofic Shifts (2004) (2)
- Codes and Automata in Minimal Sets (2015) (2)
- Bifix codes and the finite index basis property (2013) (1)
- Groups, Languages and Dendric Shifts (2018) (1)
- C O ] 2 6 D ec 2 01 3 Acyclic , connected and tree sets (2013) (1)
- Free Profinite Monoids, Semigroups and Groups (2020) (1)
- Finitely generated submonoids (2021) (1)
- Embeddings of local automata (2010) (1)
- Bifix codes in acyclic sets (2013) (1)
- Recent results on syntactic groups of codes (2011) (1)
- [Hepatitis and dentistry]. (1983) (1)
- Embeddings of automata (2007) (1)
- Return words in interval exchange transformations (2013) (1)
- A survey on difference hierarchies of regular languages (2017) (1)
- The Degree of a Finite Set of Words (2021) (1)
- Rigidity and substitutive tree words (2017) (1)
- Birecurrent sets (2017) (1)
- A note on one-sided recognizable morphisms (2022) (1)
- Notes on sets of first return (2013) (1)
- Codes and Automata: Groups of codes (2009) (0)
- MARIE-PIERRE BÉAL, SYLVAIN LOMBARDY AND DOMINIQUE PERRIN (2011) (0)
- Codes and Noncommutative Stochastic Matrices (2008) (0)
- Linear involutions , bifix codes and free groups (2014) (0)
- Parsing with a nite di tionaryJulien Cl (0)
- D S ] 1 M ar 2 02 1 Unambiguously coded systems (2021) (0)
- Operational experience with scintillating fiber calorimeters (1985) (0)
- Mathematics in Computer Science (2008) (0)
- Preface (2005) (0)
- Variants of the road coloring problem (2008) (0)
- Graded alphabets, circular codes, free Lie algebras and comma-free codes (2021) (0)
- D M ] 3 0 M ay 2 01 6 Specular sets (2018) (0)
- REVIEWS-Infinite words: Automata, semigroups, logic and games (2005) (0)
- Return words and palindromes in specular sets ∗ (2016) (0)
- Polynomials of finite codes (2009) (0)
- 2 0 Fe b 20 15 The finite index basis property (2015) (0)
- Unambiguously coded shifts (2021) (0)
- Proceedings of the LITP spring school on theoretical computer science on Electronic dictionaries and automata in computational linguistics (1987) (0)
- C O ] 6 S ep 2 01 3 Note on sets of first return (2014) (0)
- Codes and Automata: References (2009) (0)
- D M ] 2 A ug 2 01 4 The finite index basis property (2014) (0)
- AH ierarchy of Irreducible Sof ic Shifts (2004) (0)
- Codes and Automata: Bifix codes (2009) (0)
- Les automates finis (1993) (0)
- Enumeration formul{\ae} in neutral sets (2015) (0)
- Codes and Automata: Synchronization (2009) (0)
- The Salomaa Prize 2018 was given to Dr. Jean-Éric Pin (2018) (0)
- Critical factorizations of words (1988) (0)
- Automata on Infinite Words (Abstract) (1994) (0)
- Recognizability in S-adic shifts (2023) (0)
- Codes and Automata: Factorizations of cyclic groups (2009) (0)
- Preface: Special issue on combinatorics on words (2004) (0)
- The Schützenberger Group of a Minimal Set (2020) (0)
- The Salomaa Prize 2019 was given to Dr. Artur Jez (2019) (0)
- Discrete mathematical structures: From dynamics to complexity (2013) (0)
- Rigidity Rigidity and Substitutive Dendric Words (2020) (0)
- Theory and practice: the applications of combinatorics on words (2006) (0)
- Book Introduction by the Authors: Profinite Semigroups and Symbolic Dynamic (2022) (0)
- Bifix codes in normal sets (2013) (0)
- Prelude: Profinite Integers (2020) (0)
- Profinite Groups and Semigroups (2020) (0)
- La Palestine ottomane (2000) (0)
- Sturmian Sets and Tree Sets (2020) (0)
- Codes and Automata: Appendix: Research problems (2009) (0)
- Groups of Bifix Codes (2020) (0)
- Codes and Automata: Unambiguous monoids of relations (2009) (0)
- 978-0-521-88831-8-Codes and Automata (2009) (0)
- Acyclic, connected and tree sets (2014) (0)
- A note on the groups of some codes (2009) (0)
- Shift Spaces (2021) (0)
- The Palindromization Map (2022) (0)
- Solutions of exercises (2009) (0)
- C O ] 2 3 Fe b 20 15 Maximal bifix decoding (2014) (0)
- The synta ti graph of a so(cid:12) shift (2011) (0)
This paper list is powered by the following services:
Other Resources About Dominique Perrin
What Schools Are Affiliated With Dominique Perrin?
Dominique Perrin is affiliated with the following schools:
