Dominique Perrin

ORCID

Publication Activity (10 Years)

Years Active: 1971-2024
Publications (10 Years): 29

Top Venues

Univ. Paris (PHD)

Education History

Univ. Paris

PHD

Publications

Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
Unambiguously coded shifts. Eur. J. Comb. 119 (2024)
Valérie Berthé, Herman Goulet-Ouellet, Carl-Fredrik Nyberg-Brodda, Dominique Perrin, Karl Petersen
Density of group languages in shift spaces. CoRR (2024)
Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
Decidable problems in substitution shifts. J. Comput. Syst. Sci. 143 (2024)
Dominique Perrin, Christophe Reutenauer
The palindromization map. Discret. Appl. Math. 340 (2023)
Marie-Pierre Béal, Dominique Perrin, Antonio Restivo, Wolfgang Steiner
Recognizability in S-adic shifts. CoRR (2023)
Jorge Almeida, Alfredo Costa, Revekka Kyriakoglou, Dominique Perrin
Book Introduction by the Authors: Profinite Semigroups and Symbolic Dynamic. Bull. EATCS 136 (2022)
Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
Recognizability of morphisms. CoRR (2021)
Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
Unambiguously coded systems. CoRR (2021)
Dominique Perrin, Christophe Reutenauer
Graded alphabets, circular codes, free Lie algebras and comma-free codes. Discret. Math. 344 (1) (2021)
Dominique Perrin, Andrew Ryzhikov
Finitely generated submonoids. CoRR (2021)
Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
Decidable problems in substitution shifts. CoRR (2021)
Clelia De Felice, Dominique Perrin, Antonio Restivo
Aldo de Luca (1941-2018). Theor. Comput. Sci. 834 (2020)
Dominique Perrin, Andrew Ryzhikov
The Degree of a Finite Set of Words. FSTTCS (2020)
Fabien Durand, Dominique Perrin
Dimension Groups and Dynamical Systems. CoRR (2020)
Francesco Dolce, Dominique Perrin
Eventually Dendric Shifts. CSR (2019)
Francesco Dolce, Dominique Perrin
Return Words and Bifix Codes in Eventually Dendric Sets. WORDS (2019)
Mikhail V. Volkov, Juhani Karhumäki, Dominique Perrin
The Salomaa Prize 2019 was given to Dr. Artur Jez. Bull. EATCS 129 (2019)
Dominique Perrin
Groups, Languages and Dendric Shifts. DLT (2018)
Juhani Karhumäki, Dominique Perrin, Mikhail V. Volkov
The Salomaa Prize 2018 was given to Dr. Jean-Éric Pin. Bull. EATCS 126 (2018)
Valérie Berthé, Francesco Dolce, Fabien Durand, Julien Leroy, Dominique Perrin
Rigidity and Substitutive Dendric Words. Int. J. Found. Comput. Sci. 29 (5) (2018)
Olivier Carton, Dominique Perrin, Jean-Éric Pin
A survey on difference hierarchies of regular languages. Log. Methods Comput. Sci. 14 (1) (2018)
Dominique Perrin, Christophe Reutenauer
Hall sets, Lazard sets and comma-free codes. Discret. Math. 341 (1) (2018)
Francesco Dolce, Dominique Perrin, Antonio Restivo, Christophe Reutenauer, Giuseppina Rindone
Birecurrent sets. Int. J. Algebra Comput. 28 (4) (2018)
Francesco Dolce, Dominique Perrin, Antonio Restivo, Christophe Reutenauer, Giuseppina Rindone
Recurrent and birecurrent sets. CoRR (2017)
Revekka Kyriakoglou, Dominique Perrin
Profinite semigroups. CoRR (2017)
Olivier Carton, Dominique Perrin, Jean-Éric Pin
A survey on difference hierarchies of regular languages. CoRR (2017)
Francesco Dolce, Dominique Perrin
Interval exchanges, admissibility and branching Rauzy induction. RAIRO Theor. Informatics Appl. 51 (3) (2017)
Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Specular sets. Theor. Comput. Sci. 684 (2017)
Francesco Dolce, Dominique Perrin
Neutral and tree sets of arbitrary characteristic. Theor. Comput. Sci. 658 (2017)
Eduardo Moreno, Dominique Perrin
Corrigendum to "On the theorem of Fredricksen and Maiorana about de Bruijn sequences" [Adv. in Appl. Math. 33 (2) (2004) 413-415]. Adv. Appl. Math. 62 (2015)
Valérie Berthé, Clelia de Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Maximal bifix decoding. Discret. Math. 338 (5) (2015)
Francesco Dolce, Dominique Perrin
Enumeration formulæ in neutral sets. CoRR (2015)
Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Specular Sets. WORDS (2015)
Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Specular sets. CoRR (2015)
Francesco Dolce, Dominique Perrin
Enumeration Formulæ in Neutral Sets. DLT (2015)
Dominique Perrin
Codes and Automata in Minimal Sets. WORDS (2015)
Marie-Pierre Béal, Dominique Perrin
A quadratic algorithm for road coloring. Discret. Appl. Math. 169 (2014)
Dominique Perrin
Completely Reducible Sets. Int. J. Algebra Comput. 23 (4) (2013)
Valérie Berthé, Clelia de Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Bifix codes in acyclic sets. CoRR (2013)
Valérie Berthé, Clelia de Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Return words in interval exchange transformations CoRR (2013)
Cristian Calude, Bruno Durand, Anahí Gajardo, Dominique Perrin, Ivan Rapaport, Sergio Rica
Discrete mathematical structures: From dynamics to complexity. Theor. Comput. Sci. 504 (2013)
Valérie Berthé, Clelia de Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Bifix codes and the finite index basis property CoRR (2013)
Eugene Asarin, Nicolas Basset, Marie-Pierre Béal, Aldric Degorre, Dominique Perrin
Toward a Timed Theory of Channel Coding. FORMATS (2012)
Dominique Perrin, Antonio Restivo
A note on Sturmian words. Theor. Comput. Sci. 429 (2012)
Dominique Perrin
Completely reducible sets CoRR (2012)
Eugene Asarin, Nicolas Basset, Aldric Degorre, Dominique Perrin
Generating Functions of Timed Languages. MFCS (2012)
Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Recent results on syntactic groups of prefix codes. Eur. J. Comb. 33 (7) (2012)
Marie-Pierre Béal, Mikhail V. Berlinkov, Dominique Perrin
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. Int. J. Found. Comput. Sci. 22 (2) (2011)
Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
Bifix codes and Sturmian words CoRR (2010)
Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin
Symbolic dynamics CoRR (2010)
Marie-Pierre Béal, Dominique Perrin
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. Developments in Language Theory (2009)
Marie-Pierre Béal, Dominique Perrin
Completing codes in a sofic shift. Theor. Comput. Sci. 410 (43) (2009)
Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin
Embeddings of local automata. ISIT (2008)
Olivier Carton, Dominique Perrin, Jean-Eric Pin
Automata and semigroups recognizing infinite words. Logic and Automata (2008)
Marie-Pierre Béal, Dominique Perrin
A quadratic algorithm for road coloring CoRR (2008)
Sylvain Lavallée, Christophe Reutenauer, Vladimir Retakh, Dominique Perrin
Codes and Noncommutative Stochastic Matrices CoRR (2008)
Marie-Pierre Béal, Eugen Czeizler, Jarkko Kari, Dominique Perrin
Unambiguous Automata. Math. Comput. Sci. 1 (4) (2008)
Jean Berstel, Dominique Perrin
The origins of combinatorics on words. Eur. J. Comb. 28 (3) (2007)
Marie-Pierre Béal, Dominique Perrin
Codes, unambiguous automata and sofic systems. Theor. Comput. Sci. 356 (1-2) (2006)
Marie-Pierre Béal, Dominique Perrin
Complete Codes in a Sofic Shift. STACS (2006)
Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
The Syntactic Graph of a Sofic Shift Is Invariant under Shift Equivalence. Int. J. Algebra Comput. 16 (3) (2006)
Maxime Crochemore, Jacques Désarménien, Dominique Perrin
A note on the Burrows-Wheeler transformation CoRR (2005)
Marie-Pierre Béal, Dominique Perrin
Codes and sofic constraints. Theor. Comput. Sci. 340 (1) (2005)
Maxime Crochemore, Jacques Désarménien, Dominique Perrin
A note on the Burrows - CWheeler transformation. Theor. Comput. Sci. 332 (1-3) (2005)
Julien Clément, Jean-Pierre Duval, Giovanna Guaiana, Dominique Perrin, Giuseppina Rindone
Parsing with a finite dictionary. Theor. Comput. Sci. 340 (1) (2005)
Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
A hierarchy of shift equivalent sofic shifts. Theor. Comput. Sci. 345 (2-3) (2005)
Aldo de Luca, Filippo Mignosi, Dominique Perrin, Grzegorz Rozenberg
Preface. Theor. Comput. Sci. 340 (1) (2005)
Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
The Syntactic Graph of a Sofic Shift. STACS (2004)
Jean-Marc Champarnaud, Georges Hansel, Dominique Perrin
Unavoidable Sets of Constant Length. Int. J. Algebra Comput. 14 (2) (2004)
Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
A Hierarchy of Irreducible Sofic Shifts. MFCS (2004)
Marie-Pierre Béal, Dominique Perrin
symbols. J. ACM 50 (6) (2003)
Marie-Pierre Béal, Dominique Perrin
On the Enumerative Sequences of Regular Languages on k Symbols. STACS (2002)
Marie-Pierre Béal, Dominique Perrin
A weak equivalence between shifts of finite type. Adv. Appl. Math. 29 (2) (2002)
Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
A Finite State Version of the Kraft--McMillan Theorem. SIAM J. Comput. 30 (4) (2000)
Véronique Bruyère, Dominique Perrin
Maximal Bifix Codes. Theor. Comput. Sci. 218 (1) (1999)
Olivier Carton, Dominique Perrin
The Wagner Hierarchy. Int. J. Algebra Comput. 9 (5) (1999)
Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
Enumerative Sequences of Leaves and Nodes in Rational Trees. Theor. Comput. Sci. 221 (1-2) (1999)
Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
Super-State Automata and Rational Trees. LATIN (1998)
Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
Enumerative Sequences of Leaves in Rational Trees. ICALP (1997)
Olivier Carton, Dominique Perrin
Chains and Superchains for ω-Rational Sets, Automata and Semigroups. Int. J. Algebra Comput. 7 (6) (1997)
Olivier Carton, Dominique Perrin
The Wadge-Wagner Hierarchy of omega-Rational Sets. ICALP (1997)
Dominique Perrin
Symbolic Dynamics and Finite Automata. MFCS (1995)
Dominique Perrin
Automata on Infinite Words (Abstract). IFIP Congress (1) (1994)
Jonathan J. Ashley, Brian H. Marcus, Dominique Perrin, Selim Tuncel
Surjective Extensions of Sliding-Block Codes. SIAM J. Discret. Math. 6 (4) (1993)
Joëlle Cohen, Dominique Perrin, Jean-Eric Pin
On the Expressive Power of Temporal Logic. J. Comput. Syst. Sci. 46 (3) (1993)
Georges Hansel, Dominique Perrin, Imre Simon
Compression and Entropy. STACS (1992)
Dominique Perrin
On Positive Matrices. Theor. Comput. Sci. 94 (2) (1992)
Maxime Crochemore, Dominique Perrin
Two-Way String Matching. J. ACM 38 (3) (1991)
Georges Hansel, Dominique Perrin
Rational Probability Measures. Theor. Comput. Sci. 65 (2) (1989)
Dominique Perrin
Partial Commutations. ICALP (1989)
Maxime Crochemore, Dominique Perrin
Critical factorizations of words. Bull. EATCS 34 (1988)
Dominique Perrin
Local Maps. Automata Networks (1986)
Dominique Perrin, Jean-Eric Pin
First-Order Logic and Star-Free Sets. J. Comput. Syst. Sci. 32 (3) (1986)
Dominique Perrin, Paul E. Schupp
Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories LICS (1986)
Dominique Perrin
On the solution of Ehrenfeucht's conjecture. Bull. EATCS 27 (1985)
Robert Cori, Dominique Perrin
Automates et Commutations Partielles. RAIRO Theor. Informatics Appl. 19 (1) (1985)
Danièle Beauquier, Dominique Perrin
Codeterministic Automata on Infinite Words. Inf. Process. Lett. 20 (2) (1985)
Dominique Perrin
Recent Results on Automata and Infinite Words. MFCS (1984)
Dominique Perrin
Completing Biprefix Codes. Theor. Comput. Sci. 28 (1984)
Dominique Perrin, Paul E. Schupp
Sur les Monoides À un Relateur qui sont des Groupes. Theor. Comput. Sci. 33 (1984)

Dominique Perrin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Dominique Perrin