Dominique Perrin

Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone: Recent results on syntactic groups of prefix codes. Eur. J. Comb. 33(7): 1386-1401 (2012)

Dominique Perrin, Antonio Restivo: A note on Sturmian words. Theor. Comput. Sci. 429: 265-272 (2012)

Eugene Asarin, Nicolas Basset, Marie-Pierre Béal, Aldric Degorre, Dominique Perrin: Toward a Timed Theory of Channel Coding. FORMATS 2012: 27-42

Eugene Asarin, Nicolas Basset, Aldric Degorre, Dominique Perrin: Generating Functions of Timed Languages. MFCS 2012: 124-135

Dominique Perrin: Completely reducible sets. CoRR abs/1209.2035 (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): 277-288 (2011)

Marie-Pierre Béal, Jean Berstel, S. Eilers, Dominique Perrin: Symbolic dynamics. CoRR abs/1006.1265 (2010)

Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone: Bifix codes and Sturmian words. CoRR abs/1011.5369 (2010)

Marie-Pierre Béal, Dominique Perrin: Completing codes in a sofic shift. Theor. Comput. Sci. 410(43): 4423-4431 (2009)

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: 81-90

Marie-Pierre Béal, Eugen Czeizler, Jarkko Kari, Dominique Perrin: Unambiguous Automata. Mathematics in Computer Science 1(4): 625-638 (2008)

Olivier Carton, Dominique Perrin, Jean-Eric Pin: Automata and semigroups recognizing infinite words. Logic and Automata 2008: 133-168

Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin: Embeddings of local automata. ISIT 2008: 2351-2355

Marie-Pierre Béal, Dominique Perrin: A quadratic algorithm for road coloring. CoRR abs/0803.0726 (2008)

Sylvain Lavallée, Christophe Reutenauer, Vladimir Retakh, Dominique Perrin: Codes and Noncommutative Stochastic Matrices. CoRR abs/0808.4100 (2008)

Jean Berstel, Dominique Perrin: The origins of combinatorics on words. Eur. J. Comb. 28(3): 996-1022 (2007)

Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin: The Syntactic Graph of a Sofic Shift Is Invariant under Shift Equivalence. IJAC 16(3): 443-460 (2006)

Marie-Pierre Béal, Dominique Perrin: Codes, unambiguous automata and sofic systems. Theor. Comput. Sci. 356(1-2): 6-13 (2006)

Marie-Pierre Béal, Dominique Perrin: Complete Codes in a Sofic Shift. STACS 2006: 127-136

Maxime Crochemore, Jacques Désarménien, Dominique Perrin: A note on the Burrows - CWheeler transformation. Theor. Comput. Sci. 332(1-3): 567-572 (2005)

Aldo de Luca, Filippo Mignosi, Dominique Perrin, Grzegorz Rozenberg: Preface. Theor. Comput. Sci. 340(1): 179-185 (2005)

Marie-Pierre Béal, Dominique Perrin: Codes and sofic constraints. Theor. Comput. Sci. 340(1): 381-393 (2005)

Julien Clément, Jean-Pierre Duval, Giovanna Guaiana, Dominique Perrin, Giuseppina Rindone: Parsing with a finite dictionary. Theor. Comput. Sci. 340(1): 432-442 (2005)

Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin: A hierarchy of shift equivalent sofic shifts. Theor. Comput. Sci. 345(2-3): 190-205 (2005)

Maxime Crochemore, Jacques Désarménien, Dominique Perrin: A note on the Burrows-Wheeler transformation. CoRR abs/cs/0502073 (2005)

Jean-Marc Champarnaud, Georges Hansel, Dominique Perrin: Unavoidable Sets of Constant Length. IJAC 14(2): 241-251 (2004)

Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin: A Hierarchy of Irreducible Sofic Shifts. MFCS 2004: 611-622

Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin: The Syntactic Graph of a Sofic Shift. STACS 2004: 282-293

Marie-Pierre Béal, Dominique Perrin: On the generating sequences of regular languages on k symbols. J. ACM 50(6): 955-980 (2003)

Marie-Pierre Béal, Dominique Perrin: On the Enumerative Sequences of Regular Languages on k Symbols. STACS 2002: 547-558

Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin: A Finite State Version of the Kraft--McMillan Theorem. SIAM J. Comput. 30(4): 1211-1230 (2000)

Olivier Carton, Dominique Perrin: The Wagner Hierarchy. IJAC 9(5): 597-620 (1999)

Véronique Bruyère, Dominique Perrin: Maximal Bifix Codes. Theor. Comput. Sci. 218(1): 107-121 (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): 41-60 (1999)

Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin: Super-State Automata and Rational Trees. LATIN 1998: 42-52

Olivier Carton, Dominique Perrin: The Wadge-Wagner Hierarchy of omega-Rational Sets. ICALP 1997: 17-35

Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin: Enumerative Sequences of Leaves in Rational Trees. ICALP 1997: 76-86

Dominique Perrin: Symbolic Dynamics and Finite Automata. MFCS 1995: 94-104

Dominique Perrin: Automata on Infinite Words (Abstract). IFIP Congress (1) 1994: 491-492

Joëlle Cohen, Dominique Perrin, Jean-Eric Pin: On the Expressive Power of Temporal Logic. J. Comput. Syst. Sci. 46(3): 271-294 (1993)

Jonathan J. Ashley, Brian H. Marcus, Dominique Perrin, Selim Tuncel: Surjective Extensions of Sliding-Block Codes. SIAM J. Discrete Math. 6(4): 582-611 (1993)

Dominique Perrin: On Positive Matrices. Theor. Comput. Sci. 94(2): 357-366 (1992)

Georges Hansel, Dominique Perrin, Imre Simon: Compression and Entropy. STACS 1992: 515-528

Maxime Crochemore, Dominique Perrin: Two-Way String Matching. J. ACM 38(3): 651-675 (1991)

Dominique Perrin: Finite Automata. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 1-57

Georges Hansel, Dominique Perrin: Rational Probability Measures. Theor. Comput. Sci. 65(2): 171-188 (1989)

Dominique Perrin: Partial Commutations. ICALP 1989: 637-651

Maurice Gross, Dominique Perrin (Eds.): 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. Lecture Notes in Computer Science 377, Springer 1989, isbn 3-540-51465-1

Maxime Crochemore, Dominique Perrin: Critical factorizations of words. Bulletin of the EATCS 34: 47-51 (1988)

Dominique Perrin, Jean-Eric Pin: First-Order Logic and Star-Free Sets. J. Comput. Syst. Sci. 32(3): 393-406 (1986)

Dominique Perrin, Paul E. Schupp: Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories. LICS 1986: 301-304

Dominique Perrin: Local Maps. Automata Networks 1986: 29-41

Dominique Perrin: On the solution of Ehrenfeucht's conjecture. Bulletin of the EATCS 27: 68-70 (1985)

Danièle Beauquier, Dominique Perrin: Codeterministic Automata on Infinite Words. Inf. Process. Lett. 20(2): 95-98 (1985)

Robert Cori, Dominique Perrin: Automates et Commutations Partielles. ITA 19(1): 21-32 (1985)

Maurice Nivat, Dominique Perrin (Eds.): Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique, Le Mont Dore, May 14-18, 1984. Lecture Notes in Computer Science 192, Springer 1985, isbn 3-540-15641-0

Dominique Perrin: Completing Biprefix Codes. Theor. Comput. Sci. 28: 329-336 (1984)

Dominique Perrin, Paul E. Schupp: Sur les Monoides À un Relateur qui sont des Groupes. Theor. Comput. Sci. 33: 331-334 (1984)

Dominique Perrin: An introduction to finite automata on infinite words. Automata on Infinite Words 1984: 2-17

Dominique Perrin: Recent Results on Automata and Infinite Words. MFCS 1984: 134-148

Georges Hansel, Dominique Perrin: Codes and Bernoulli Partitions. Mathematical Systems Theory 16(2): 133-157 (1983)

Dominique Perrin: Varietes de Semigroupes et Mots Infinis. ICALP 1983: 610-616

Dominique Perrin: Completing Biprefix Codes. ICALP 1982: 397-406

Maurice Nivat, Dominique Perrin: Ensembles Reconnaissables de Mots Biinfinis. STOC 1982: 47-59

Gerard Lallement, Dominique Perrin: A graph covering construction of all the finite complete biprefix codes. Discrete Mathematics 36(3): 261-271 (1981)

Dominique Perrin: La Representation Ergodique d'un Automate fini. Theor. Comput. Sci. 9: 221-241 (1979)

Dominique Perrin: Le degré minimal du groupe d'un code bipréfixe fini. J. Comb. Theory, Ser. A 25(2): 163-173 (1978)

Dominique Perrin: Sur la longeur moyenne des codes préfixes. ICALP 1976: 45-51

Dominique Perrin: The Characteristic Polynomial of a Finite Automaton. MFCS 1976: 453-457

Dominique Perrin: Codes conjugués. Information and Control 20(3): 222-231 (1972)

Dominique Perrin, Jean-François Perrot: Congruences et Automorphismes des Automates Finis. Acta Inf. 1: 159-172 (1971)

Dominique Perrin: Le langage engendre par un code prefixe et son monoide syntaxique. Univ. Paris 1970, pp. 1-113