Dominique Perrin

124 papers A* 9A 4B 7C 3Misc 1Journal 83Unranked 9

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Sequential densities of rational languages. CoRR Alexi Block Gorman, Dominique Perrin
2025	A*	`conf`	Density of Rational Languages Under Shift Invariant Measures. ICALP Valérie Berthé, Herman Goulet-Ouellet, Dominique Perrin
2025	J	`jnl`	Density of rational languages under shift invariant measures. CoRR Valérie Berthé, Herman Goulet-Ouellet, Dominique Perrin
2024	J	`jnl`	Decidable problems in substitution shifts. J. Comput. Syst. Sci. Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
2024	J	`jnl`	Density of group languages in shift spaces. CoRR Valérie Berthé, Herman Goulet-Ouellet, Carl-Fredrik Nyberg-Brodda, Dominique Perrin, Karl Petersen
2024	J	`jnl`	Unambiguously coded shifts. Eur. J. Comb. Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
2023	J	`jnl`	Recognizability in S-adic shifts. CoRR Marie-Pierre Béal, Dominique Perrin, Antonio Restivo, Wolfgang Steiner
2023	J	`jnl`	The palindromization map. Discret. Appl. Math. Dominique Perrin, Christophe Reutenauer
2022	J	`jnl`	Book Introduction by the Authors: Profinite Semigroups and Symbolic Dynamic. Bull. EATCS Jorge Almeida, Alfredo Costa, Revekka Kyriakoglou, Dominique Perrin
2021	J	`jnl`	Decidable problems in substitution shifts. CoRR Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
2021	J	`jnl`	Finitely generated submonoids. CoRR Dominique Perrin, Andrew Ryzhikov
2021	J	`jnl`	Graded alphabets, circular codes, free Lie algebras and comma-free codes. Discret. Math. Dominique Perrin, Christophe Reutenauer
2021	J	`jnl`	Recognizability of morphisms. CoRR Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
2021	—	`ch.`	Symbolic dynamics. Handbook of Automata Theory (II.) Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin
2021	J	`jnl`	Unambiguously coded systems. CoRR Marie-Pierre Béal, Dominique Perrin, Antonio Restivo
2020	J	`jnl`	Aldo de Luca (1941-2018). Theor. Comput. Sci. Clelia De Felice, Dominique Perrin, Antonio Restivo
2020	J	`jnl`	Dimension Groups and Dynamical Systems. CoRR Fabien Durand, Dominique Perrin
2020	—	`conf`	The Degree of a Finite Set of Words. FSTTCS Dominique Perrin, Andrew Ryzhikov
2019	Misc	`conf`	Eventually Dendric Shifts. CSR Francesco Dolce, Dominique Perrin
2019	—	`conf`	Return Words and Bifix Codes in Eventually Dendric Sets. WORDS Francesco Dolce, Dominique Perrin
2019	J	`jnl`	The Salomaa Prize 2019 was given to Dr. Artur Jez. Bull. EATCS Mikhail V. Volkov, Juhani Karhumäki, Dominique Perrin
2018	J	`jnl`	A survey on difference hierarchies of regular languages. Log. Methods Comput. Sci. Olivier Carton, Dominique Perrin, Jean-Éric Pin
2018	J	`jnl`	Birecurrent sets. Int. J. Algebra Comput. Francesco Dolce, Dominique Perrin, Antonio Restivo, Christophe Reutenauer, Giuseppina Rindone
2018	C	`conf`	Groups, Languages and Dendric Shifts. DLT Dominique Perrin
2018	J	`jnl`	Hall sets, Lazard sets and comma-free codes. Discret. Math. Dominique Perrin, Christophe Reutenauer
2018	J	`jnl`	Rigidity and Substitutive Dendric Words. Int. J. Found. Comput. Sci. Valérie Berthé, Francesco Dolce, Fabien Durand, Julien Leroy, Dominique Perrin
2018	J	`jnl`	The Salomaa Prize 2018 was given to Dr. Jean-Éric Pin. Bull. EATCS Juhani Karhumäki, Dominique Perrin, Mikhail V. Volkov
2017	J	`jnl`	A survey on difference hierarchies of regular languages. CoRR Olivier Carton, Dominique Perrin, Jean-Éric Pin
2017	J	`jnl`	Interval exchanges, admissibility and branching Rauzy induction. RAIRO Theor. Informatics Appl. Francesco Dolce, Dominique Perrin
2017	J	`jnl`	Neutral and tree sets of arbitrary characteristic. Theor. Comput. Sci. Francesco Dolce, Dominique Perrin
2017	J	`jnl`	Profinite semigroups. CoRR Revekka Kyriakoglou, Dominique Perrin
2017	J	`jnl`	Recurrent and birecurrent sets. CoRR Francesco Dolce, Dominique Perrin, Antonio Restivo, Christophe Reutenauer, Giuseppina Rindone
2017	J	`jnl`	Specular sets. Theor. Comput. Sci. Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
2015	—	`conf`	Codes and Automata in Minimal Sets. WORDS Dominique Perrin
2015	J	`jnl`	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. Eduardo Moreno, Dominique Perrin
2015	C	`conf`	Enumeration Formulæ in Neutral Sets. DLT Francesco Dolce, Dominique Perrin
2015	J	`jnl`	Enumeration formulæ in neutral sets. CoRR Francesco Dolce, Dominique Perrin
2015	J	`jnl`	Maximal bifix decoding. Discret. Math. Valérie Berthé, Clelia De Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
2015	—	`conf`	Specular Sets. WORDS Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
2015	J	`jnl`	Specular sets. CoRR Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
2014	J	`jnl`	A quadratic algorithm for road coloring. Discret. Appl. Math. Marie-Pierre Béal, Dominique Perrin
2013	J	`jnl`	Bifix codes and the finite index basis property CoRR Valérie Berthé, Clelia De Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
2013	J	`jnl`	Bifix codes in acyclic sets. CoRR Valérie Berthé, Clelia De Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
2013	J	`jnl`	Completely Reducible Sets. Int. J. Algebra Comput. Dominique Perrin
2013	J	`jnl`	Discrete mathematical structures: From dynamics to complexity. Theor. Comput. Sci. Cristian Calude, Bruno Durand, Anahí Gajardo, Dominique Perrin, Ivan Rapaport, Sergio Rica
2013	J	`jnl`	Return words in interval exchange transformations CoRR Valérie Berthé, Clelia De Felice, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
2012	J	`jnl`	A note on Sturmian words. Theor. Comput. Sci. Dominique Perrin, Antonio Restivo
2012	J	`jnl`	Completely reducible sets CoRR Dominique Perrin
2012	B	`conf`	Generating Functions of Timed Languages. MFCS Eugene Asarin, Nicolas Basset, Aldric Degorre, Dominique Perrin
2012	J	`jnl`	Recent results on syntactic groups of prefix codes. Eur. J. Comb. Jean Berstel, Clelia De Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
2012	—	`conf`	Toward a Timed Theory of Channel Coding. FORMATS Eugene Asarin, Nicolas Basset, Marie-Pierre Béal, Aldric Degorre, Dominique Perrin
2011	J	`jnl`	A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. Int. J. Found. Comput. Sci. Marie-Pierre Béal, Mikhail V. Berlinkov, Dominique Perrin
2010	J	`jnl`	Bifix codes and Sturmian words CoRR Jean Berstel, Clelia De Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone
2010	—	`book`	Codes and Automata. Jean Berstel, Dominique Perrin, Christophe Reutenauer
2010	J	`jnl`	Symbolic dynamics CoRR Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin
2009	C	`conf`	A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. Developments in Language Theory Marie-Pierre Béal, Dominique Perrin
2009	J	`jnl`	Completing codes in a sofic shift. Theor. Comput. Sci. Marie-Pierre Béal, Dominique Perrin
2008	J	`jnl`	A quadratic algorithm for road coloring CoRR Marie-Pierre Béal, Dominique Perrin
2008	—	`conf`	Automata and semigroups recognizing infinite words. Logic and Automata Olivier Carton, Dominique Perrin, Jean-Eric Pin
2008	J	`jnl`	Codes and Noncommutative Stochastic Matrices CoRR Sylvain Lavallée, Christophe Reutenauer, Vladimir Retakh, Dominique Perrin
2008	B	`conf`	Embeddings of local automata. ISIT Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin
2008	J	`jnl`	Unambiguous Automata. Math. Comput. Sci. Marie-Pierre Béal, Eugen Czeizler, Jarkko Kari, Dominique Perrin
2007	J	`jnl`	The origins of combinatorics on words. Eur. J. Comb. Jean Berstel, Dominique Perrin
2006	J	`jnl`	Codes, unambiguous automata and sofic systems. Theor. Comput. Sci. Marie-Pierre Béal, Dominique Perrin
2006	A	`conf`	Complete Codes in a Sofic Shift. STACS Marie-Pierre Béal, Dominique Perrin
2006	J	`jnl`	The Syntactic Graph of a Sofic Shift Is Invariant under Shift Equivalence. Int. J. Algebra Comput. Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
2005	J	`jnl`	A hierarchy of shift equivalent sofic shifts. Theor. Comput. Sci. Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
2005	J	`jnl`	A note on the Burrows - CWheeler transformation. Theor. Comput. Sci. Maxime Crochemore, Jacques Désarménien, Dominique Perrin
2005	J	`jnl`	A note on the Burrows-Wheeler transformation CoRR Maxime Crochemore, Jacques Désarménien, Dominique Perrin
2005	J	`jnl`	Codes and sofic constraints. Theor. Comput. Sci. Marie-Pierre Béal, Dominique Perrin
2005	J	`jnl`	Parsing with a finite dictionary. Theor. Comput. Sci. Julien Clément, Jean-Pierre Duval, Giovanna Guaiana, Dominique Perrin, Giuseppina Rindone
2005	J	`jnl`	Preface. Theor. Comput. Sci. Aldo de Luca, Filippo Mignosi, Dominique Perrin, Grzegorz Rozenberg
2004	B	`conf`	A Hierarchy of Irreducible Sofic Shifts. MFCS Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
2004	—	`book`	Infinite words - automata, semigroups, logic and games. Dominique Perrin, Jean-Eric Pin
2004	A	`conf`	The Syntactic Graph of a Sofic Shift. STACS Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
2004	J	`jnl`	Unavoidable Sets of Constant Length. Int. J. Algebra Comput. Jean-Marc Champarnaud, Georges Hansel, Dominique Perrin
2003	J	`jnl`	On the generating sequences of regular languages on J. ACM Marie-Pierre Béal, Dominique Perrin
2002	J	`jnl`	A weak equivalence between shifts of finite type. Adv. Appl. Math. Marie-Pierre Béal, Dominique Perrin
2002	A	`conf`	On the Enumerative Sequences of Regular Languages on k Symbols. STACS Marie-Pierre Béal, Dominique Perrin
2000	J	`jnl`	A Finite State Version of the Kraft--McMillan Theorem. SIAM J. Comput. Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
1999	J	`jnl`	Enumerative Sequences of Leaves and Nodes in Rational Trees. Theor. Comput. Sci. Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
1999	J	`jnl`	Maximal Bifix Codes. Theor. Comput. Sci. Véronique Bruyère, Dominique Perrin
1999	J	`jnl`	The Wagner Hierarchy. Int. J. Algebra Comput. Olivier Carton, Dominique Perrin
1998	B	`conf`	Super-State Automata and Rational Trees. LATIN Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
1997	J	`jnl`	Chains and Superchains for ω-Rational Sets, Automata and Semigroups. Int. J. Algebra Comput. Olivier Carton, Dominique Perrin
1997	A*	`conf`	Enumerative Sequences of Leaves in Rational Trees. ICALP Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin
1997	—	`ch.`	Symbolic Dynamics and Finite Automata. Handbook of Formal Languages (2) Marie-Pierre Béal, Dominique Perrin
1997	A*	`conf`	The Wadge-Wagner Hierarchy of omega-Rational Sets. ICALP Olivier Carton, Dominique Perrin
1995	B	`conf`	Symbolic Dynamics and Finite Automata. MFCS Dominique Perrin
1994	—	`conf`	Automata on Infinite Words (Abstract). IFIP Congress (1) Dominique Perrin
1993	J	`jnl`	On the Expressive Power of Temporal Logic. J. Comput. Syst. Sci. Joëlle Cohen, Dominique Perrin, Jean-Eric Pin
1993	J	`jnl`	Surjective Extensions of Sliding-Block Codes. SIAM J. Discret. Math. Jonathan J. Ashley, Brian H. Marcus, Dominique Perrin, Selim Tuncel
1992	A	`conf`	Compression and Entropy. STACS Georges Hansel, Dominique Perrin, Imre Simon
1992	J	`jnl`	On Positive Matrices. Theor. Comput. Sci. Dominique Perrin
1991	J	`jnl`	Two-Way String Matching. J. ACM Maxime Crochemore, Dominique Perrin
1990	—	`ch.`	Finite Automata. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) Dominique Perrin
1989	—	`ed.`	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 Electronic Dictionaries and Automata in Computational Linguistics Maurice Gross, Dominique Perrin
1989	A*	`conf`	Partial Commutations. ICALP Dominique Perrin
1989	J	`jnl`	Rational Probability Measures. Theor. Comput. Sci. Georges Hansel, Dominique Perrin
1988	J	`jnl`	Critical factorizations of words. Bull. EATCS Maxime Crochemore, Dominique Perrin
1986	A*	`conf`	Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories LICS Dominique Perrin, Paul E. Schupp
1986	J	`jnl`	First-Order Logic and Star-Free Sets. J. Comput. Syst. Sci. Dominique Perrin, Jean-Eric Pin
1986	—	`conf`	Local Maps. Automata Networks Dominique Perrin
1985	—	`ed.`	Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique, Le Mont Dore, France, May 14-18, 1984 Automata on Infinite Words Maurice Nivat, Dominique Perrin
1985	J	`jnl`	Automates et Commutations Partielles. RAIRO Theor. Informatics Appl. Robert Cori, Dominique Perrin
1985	J	`jnl`	Codeterministic Automata on Infinite Words. Inf. Process. Lett. Danièle Beauquier, Dominique Perrin
1985	J	`jnl`	On the solution of Ehrenfeucht's conjecture. Bull. EATCS Dominique Perrin
1984	—	`conf`	An introduction to finite automata on infinite words. Automata on Infinite Words Dominique Perrin
1984	J	`jnl`	Completing Biprefix Codes. Theor. Comput. Sci. Dominique Perrin
1984	B	`conf`	Recent Results on Automata and Infinite Words. MFCS Dominique Perrin
1984	J	`jnl`	Sur les Monoides À un Relateur qui sont des Groupes. Theor. Comput. Sci. Dominique Perrin, Paul E. Schupp
1983	J	`jnl`	Codes and Bernoulli Partitions. Math. Syst. Theory Georges Hansel, Dominique Perrin
1983	A*	`conf`	Varietes de Semigroupes et Mots Infinis. ICALP Dominique Perrin
1982	A*	`conf`	Completing Biprefix Codes. ICALP Dominique Perrin
1982	A*	`conf`	Ensembles Reconnaissables de Mots Biinfinis STOC Maurice Nivat, Dominique Perrin
1981	J	`jnl`	A graph covering construction of all the finite complete biprefix codes. Discret. Math. Gerard Lallement, Dominique Perrin
1979	J	`jnl`	La Representation Ergodique d'un Automate fini. Theor. Comput. Sci. Dominique Perrin
1979	J	`jnl`	Synchronization and simplification. Discret. Math. Aldo de Luca, Dominique Perrin, Antonio Restivo, Settimo Termini
1978	J	`jnl`	Le degré minimal du groupe d'un code bipréfixe fini. J. Comb. Theory A Dominique Perrin
1976	A*	`conf`	Sur la longeur moyenne des codes préfixes. ICALP Dominique Perrin
1976	B	`conf`	The Characteristic Polynomial of a Finite Automaton. MFCS Dominique Perrin
1972	J	`jnl`	Codes conjugués Inf. Control. Dominique Perrin
1971	J	`jnl`	Congruences et Automorphismes des Automates Finis. Acta Informatica Dominique Perrin, Jean-François Perrot
1970	—	`—`	Le langage engendre par un code prefixe et son monoide syntaxique. Dominique Perrin