Dominique Perrin

According to our database, Dominique Perrin authored at least 111 papers between 1970 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Decidable problems in substitution shifts.

Marie-Pierre Béal, Dominique Perrin, Antonio Restivo

J. Comput. Syst. Sci., 2024

Unambiguously coded shifts.

Marie-Pierre Béal, Dominique Perrin, Antonio Restivo

Eur. J. Comb., 2024

Density of group languages in shift spaces.

Valérie Berthé, Herman Goulet-Ouellet, Carl-Fredrik Nyberg-Brodda, Dominique Perrin, Karl Petersen

CoRR, 2024

2023

The palindromization map.

Dominique Perrin, Christophe Reutenauer

Discret. Appl. Math., December, 2023

Recognizability in S-adic shifts.

Marie-Pierre Béal, Dominique Perrin, Antonio Restivo, Wolfgang Steiner

CoRR, 2023

2022

Book Introduction by the Authors: Profinite Semigroups and Symbolic Dynamic.

Jorge Almeida, Alfredo Costa, Revekka Kyriakoglou, Dominique Perrin

Bull. EATCS, 2022

2021

Graded alphabets, circular codes, free Lie algebras and comma-free codes.

Dominique Perrin, Christophe Reutenauer

Discret. Math., 2021

Recognizability of morphisms.

Marie-Pierre Béal, Dominique Perrin, Antonio Restivo

CoRR, 2021

Finitely generated submonoids.

Dominique Perrin, Andrew Ryzhikov

CoRR, 2021

Unambiguously coded systems.

Marie-Pierre Béal, Dominique Perrin, Antonio Restivo

CoRR, 2021

Symbolic dynamics.

Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin

Proceedings of the Handbook of Automata Theory., 2021

2020

Aldo de Luca (1941-2018).

Clelia De Felice, Dominique Perrin, Antonio Restivo

Theor. Comput. Sci., 2020

Dimension Groups and Dynamical Systems.

Fabien Durand, Dominique Perrin

CoRR, 2020

The Degree of a Finite Set of Words.

Dominique Perrin, Andrew Ryzhikov

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019

The Salomaa Prize 2019 was given to Dr. Artur Jez.

Mikhail V. Volkov, Juhani Karhumäki, Dominique Perrin

Bull. EATCS, 2019

Return Words and Bifix Codes in Eventually Dendric Sets.

Francesco Dolce, Dominique Perrin

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

Eventually Dendric Shifts.

Francesco Dolce, Dominique Perrin

Proceedings of the Computer Science - Theory and Applications, 2019

2018

A survey on difference hierarchies of regular languages.

Olivier Carton, Dominique Perrin, Jean-Éric Pin

Log. Methods Comput. Sci., 2018

Rigidity and Substitutive Dendric Words.

Valérie Berthé, Francesco Dolce, Fabien Durand, Julien Leroy, Dominique Perrin

Int. J. Found. Comput. Sci., 2018

Birecurrent sets.

Francesco Dolce, Dominique Perrin, Antonio Restivo, Christophe Reutenauer, Giuseppina Rindone

Int. J. Algebra Comput., 2018

The Salomaa Prize 2018 was given to Dr. Jean-Éric Pin.

Juhani Karhumäki, Dominique Perrin, Mikhail V. Volkov

Bull. EATCS, 2018

Hall sets, Lazard sets and comma-free codes.

Dominique Perrin, Christophe Reutenauer

Discret. Math., 2018

Groups, Languages and Dendric Shifts.

Dominique Perrin

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017

Neutral and tree sets of arbitrary characteristic.

Francesco Dolce, Dominique Perrin

Theor. Comput. Sci., 2017

Specular sets.

Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone

Theor. Comput. Sci., 2017

Interval exchanges, admissibility and branching Rauzy induction.

Francesco Dolce, Dominique Perrin

RAIRO Theor. Informatics Appl., 2017

Profinite semigroups.

Revekka Kyriakoglou, Dominique Perrin

CoRR, 2017

Recurrent and birecurrent sets.

Francesco Dolce, Dominique Perrin, Antonio Restivo, Christophe Reutenauer, Giuseppina Rindone

CoRR, 2017

2015

Maximal bifix decoding.

Valérie Berthé, Clelia de Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone

Discret. Math., 2015

Corrigendum to "On the theorem of Fredricksen and Maiorana about de Bruijn sequences" [Adv. in Appl. Math. 33 (2) (2004) 413-415].

Eduardo Moreno, Dominique Perrin

Adv. Appl. Math., 2015

Enumeration Formulæ in Neutral Sets.

Francesco Dolce, Dominique Perrin

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Codes and Automata in Minimal Sets.

Dominique Perrin

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014

A quadratic algorithm for road coloring.

Marie-Pierre Béal, Dominique Perrin

Discret. Appl. Math., 2014

2013

Discrete mathematical structures: From dynamics to complexity.

Cristian Calude, Bruno Durand, Anahí Gajardo, Dominique Perrin, Ivan Rapaport, Sergio Rica

Theor. Comput. Sci., 2013

Completely Reducible Sets.

Dominique Perrin

Int. J. Algebra Comput., 2013

Bifix codes and the finite index basis property

Valérie Berthé, Clelia de Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone

CoRR, 2013

Return words in interval exchange transformations

Valérie Berthé, Clelia de Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone

CoRR, 2013

Bifix codes in acyclic sets.

Valérie Berthé, Clelia de Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone

CoRR, 2013

2012

A note on Sturmian words.

Dominique Perrin, Antonio Restivo

Theor. Comput. Sci., 2012

Recent results on syntactic groups of prefix codes.

Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone

Eur. J. Comb., 2012

Generating Functions of Timed Languages.

Eugene Asarin, Nicolas Basset, Aldric Degorre, Dominique Perrin

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Toward a Timed Theory of Channel Coding.

Eugene Asarin, Nicolas Basset, Marie-Pierre Béal, Aldric Degorre, Dominique Perrin

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2012

2011

A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata.

Marie-Pierre Béal, Mikhail V. Berlinkov, Dominique Perrin

Int. J. Found. Comput. Sci., 2011

2010

Bifix codes and Sturmian words

Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone

CoRR, 2010

Symbolic dynamics

Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin

CoRR, 2010

Codes and Automata.

Jean Berstel, Dominique Perrin, Christophe Reutenauer

Encyclopedia of mathematics and its applications 129, Cambridge University Press, ISBN: 978-0-521-88831-8, 2010

2009

Completing codes in a sofic shift.

Marie-Pierre Béal, Dominique Perrin

Theor. Comput. Sci., 2009

A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata.

Marie-Pierre Béal, Dominique Perrin

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008

Unambiguous Automata.

Marie-Pierre Béal, Eugen Czeizler, Jarkko Kari, Dominique Perrin

Math. Comput. Sci., 2008

Codes and Noncommutative Stochastic Matrices

Sylvain Lavallée, Christophe Reutenauer, Vladimir Retakh, Dominique Perrin

CoRR, 2008

Embeddings of local automata.

Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Automata and semigroups recognizing infinite words.

Olivier Carton, Dominique Perrin, Jean-Eric Pin

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007

The origins of combinatorics on words.

Jean Berstel, Dominique Perrin

Eur. J. Comb., 2007

2006

Codes, unambiguous automata and sofic systems.

Marie-Pierre Béal, Dominique Perrin

Theor. Comput. Sci., 2006

The Syntactic Graph of a Sofic Shift Is Invariant under Shift Equivalence.

Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin

Int. J. Algebra Comput., 2006

Complete Codes in a Sofic Shift.

Marie-Pierre Béal, Dominique Perrin

Proceedings of the STACS 2006, 2006

2005

Preface.

Aldo de Luca, Filippo Mignosi, Dominique Perrin, Grzegorz Rozenberg

Theor. Comput. Sci., 2005

A note on the Burrows - CWheeler transformation.

Maxime Crochemore, Jacques Désarménien, Dominique Perrin

Theor. Comput. Sci., 2005

Parsing with a finite dictionary.

Julien Clément, Jean-Pierre Duval, Giovanna Guaiana, Dominique Perrin, Giuseppina Rindone

Theor. Comput. Sci., 2005

Codes and sofic constraints.

Marie-Pierre Béal, Dominique Perrin

Theor. Comput. Sci., 2005

A hierarchy of shift equivalent sofic shifts.

Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin

Theor. Comput. Sci., 2005

A note on the Burrows-Wheeler transformation

Maxime Crochemore, Jacques Désarménien, Dominique Perrin

CoRR, 2005

2004

Unavoidable Sets of Constant Length.

Jean-Marc Champarnaud, Georges Hansel, Dominique Perrin

Int. J. Algebra Comput., 2004

The Syntactic Graph of a Sofic Shift.

Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin

Proceedings of the STACS 2004, 2004

A Hierarchy of Irreducible Sofic Shifts.

Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Infinite words - automata, semigroups, logic and games.

Dominique Perrin, Jean-Eric Pin

Pure and applied mathematics series 141, Elsevier Morgan Kaufmann, ISBN: 978-0-12-532111-2, 2004

2003

On the generating sequences of regular languages on <i>k</i> symbols.

Marie-Pierre Béal, Dominique Perrin

J. ACM, 2003

2002

A weak equivalence between shifts of finite type.

Marie-Pierre Béal, Dominique Perrin

Adv. Appl. Math., 2002

On the Enumerative Sequences of Regular Languages on k Symbols.

Marie-Pierre Béal, Dominique Perrin

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

2000

A Finite State Version of the Kraft--McMillan Theorem.

Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin

SIAM J. Comput., 2000

1999

Maximal Bifix Codes.

Véronique Bruyère, Dominique Perrin

Theor. Comput. Sci., 1999

Enumerative Sequences of Leaves and Nodes in Rational Trees.

Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin

Theor. Comput. Sci., 1999

The Wagner Hierarchy.

Olivier Carton, Dominique Perrin

Int. J. Algebra Comput., 1999

1998

Super-State Automata and Rational Trees.

Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin

Proceedings of the LATIN '98: Theoretical Informatics, 1998

1997

Symbolic Dynamics and Finite Automata.

Marie-Pierre Béal, Dominique Perrin

Proceedings of the Handbook of Formal Languages, 1997

Chains and Superchains for ω-Rational Sets, Automata and Semigroups.

Olivier Carton, Dominique Perrin

Int. J. Algebra Comput., 1997

The Wadge-Wagner Hierarchy of omega-Rational Sets.

Olivier Carton, Dominique Perrin

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Enumerative Sequences of Leaves in Rational Trees.

Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1995

Symbolic Dynamics and Finite Automata.

Dominique Perrin

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994

Automata on Infinite Words (Abstract).

Dominique Perrin

Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1993

Surjective Extensions of Sliding-Block Codes.

Jonathan J. Ashley, Brian H. Marcus, Dominique Perrin, Selim Tuncel

SIAM J. Discret. Math., 1993

On the Expressive Power of Temporal Logic.

Joëlle Cohen, Dominique Perrin, Jean-Eric Pin

J. Comput. Syst. Sci., 1993

1992

On Positive Matrices.

Dominique Perrin

Theor. Comput. Sci., 1992

Compression and Entropy.

Georges Hansel, Dominique Perrin, Imre Simon

Proceedings of the STACS 92, 1992

1991

Two-Way String Matching.

Maxime Crochemore, Dominique Perrin

J. ACM, 1991

1990

Finite Automata.

Dominique Perrin

Proceedings of the Handbook of Theoretical Computer Science, 1990

1989

Rational Probability Measures.

Georges Hansel, Dominique Perrin

Theor. Comput. Sci., 1989

Partial Commutations.

Dominique Perrin

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988

Critical factorizations of words.

Maxime Crochemore, Dominique Perrin

Bull. EATCS, 1988

1986

First-Order Logic and Star-Free Sets.

Dominique Perrin, Jean-Eric Pin

J. Comput. Syst. Sci., 1986

Local Maps.

Dominique Perrin

Proceedings of the Automata Networks, LITP Spring School on Theoretical Computer Science, 1986

Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories

Dominique Perrin, Paul E. Schupp

Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

1985

Automates et Commutations Partielles.

Robert Cori, Dominique Perrin

RAIRO Theor. Informatics Appl., 1985

Codeterministic Automata on Infinite Words.

Danièle Beauquier, Dominique Perrin

Inf. Process. Lett., 1985

On the solution of Ehrenfeucht's conjecture.

Dominique Perrin

Bull. EATCS, 1985

1984

Sur les Monoides À un Relateur qui sont des Groupes.

Dominique Perrin, Paul E. Schupp

Theor. Comput. Sci., 1984

Completing Biprefix Codes.

Dominique Perrin

Theor. Comput. Sci., 1984

Recent Results on Automata and Infinite Words.

Dominique Perrin

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

An introduction to finite automata on infinite words.

Dominique Perrin

Proceedings of the Automata on Infinite Words, 1984

1983

Codes and Bernoulli Partitions.

Georges Hansel, Dominique Perrin

Math. Syst. Theory, 1983

Varietes de Semigroupes et Mots Infinis.

Dominique Perrin

Proceedings of the Automata, 1983

1982

Ensembles Reconnaissables de Mots Biinfinis

Maurice Nivat, Dominique Perrin

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

1981

A graph covering construction of all the finite complete biprefix codes.

Gerard Lallement, Dominique Perrin

Discret. Math., 1981

1979

La Representation Ergodique d'un Automate fini.

Dominique Perrin

Theor. Comput. Sci., 1979

Synchronization and simplification.

Aldo de Luca, Dominique Perrin, Antonio Restivo, Settimo Termini

Discret. Math., 1979

1978

Le degré minimal du groupe d'un code bipréfixe fini.

Dominique Perrin

J. Comb. Theory A, 1978

1976

The Characteristic Polynomial of a Finite Automaton.

Dominique Perrin

Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

Sur la longeur moyenne des codes préfixes.

Dominique Perrin

Proceedings of the Third International Colloquium on Automata, 1976

1972

Codes conjugués

Dominique Perrin

Inf. Control., April, 1972

1971

Congruences et Automorphismes des Automates Finis.

Dominique Perrin, Jean-François Perrot

Acta Informatica, 1971

1970

Le langage engendre par un code prefixe et son monoide syntaxique.

Dominique Perrin

PhD thesis, 1970