| 2008 |
|---|
| 58 | EE | Marie-Pierre Béal,
Dominique Perrin:
A quadratic algorithm for road coloring
CoRR abs/0803.0726: (2008) |
| 57 | EE | Sylvain Lavallée,
Christophe Reutenauer,
Vladimir Retakh,
Dominique Perrin:
Codes and Noncommutative Stochastic Matrices
CoRR abs/0808.4100: (2008) |
| 56 | EE | Marie-Pierre Béal,
Eugen Czeizler,
Jarkko Kari,
Dominique Perrin:
Unambiguous Automata.
Mathematics in Computer Science 1(4): 625-638 (2008) |
| 2007 |
|---|
| 55 | EE | Jean Berstel,
Dominique Perrin:
The origins of combinatorics on words.
Eur. J. Comb. 28(3): 996-1022 (2007) |
| 2006 |
|---|
| 54 | EE | Marie-Pierre Béal,
Dominique Perrin:
Complete Codes in a Sofic Shift.
STACS 2006: 127-136 |
| 53 | EE | 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) |
| 52 | EE | Marie-Pierre Béal,
Dominique Perrin:
Codes, unambiguous automata and sofic systems.
Theor. Comput. Sci. 356(1-2): 6-13 (2006) |
| 2005 |
|---|
| 51 | EE | Maxime Crochemore,
Jacques Désarménien,
Dominique Perrin:
A note on the Burrows-Wheeler transformation
CoRR abs/cs/0502073: (2005) |
| 50 | EE | Maxime Crochemore,
Jacques Désarménien,
Dominique Perrin:
A note on the Burrows - CWheeler transformation.
Theor. Comput. Sci. 332(1-3): 567-572 (2005) |
| 49 | EE | Aldo de Luca,
Filippo Mignosi,
Dominique Perrin,
Grzegorz Rozenberg:
Preface.
Theor. Comput. Sci. 340(1): 179-185 (2005) |
| 48 | EE | Marie-Pierre Béal,
Dominique Perrin:
Codes and sofic constraints.
Theor. Comput. Sci. 340(1): 381-393 (2005) |
| 47 | EE | 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) |
| 46 | EE | Marie-Pierre Béal,
Francesca Fiorenzi,
Dominique Perrin:
A hierarchy of shift equivalent sofic shifts.
Theor. Comput. Sci. 345(2-3): 190-205 (2005) |
| 2004 |
|---|
| 45 | EE | Marie-Pierre Béal,
Francesca Fiorenzi,
Dominique Perrin:
A Hierarchy of Irreducible Sofic Shifts.
MFCS 2004: 611-622 |
| 44 | EE | Marie-Pierre Béal,
Francesca Fiorenzi,
Dominique Perrin:
The Syntactic Graph of a Sofic Shift.
STACS 2004: 282-293 |
| 43 | EE | Jean-Marc Champarnaud,
Georges Hansel,
Dominique Perrin:
Unavoidable Sets of Constant Length.
IJAC 14(2): 241-251 (2004) |
| 2003 |
|---|
| 42 | EE | Marie-Pierre Béal,
Dominique Perrin:
On the generating sequences of regular languages on k symbols.
J. ACM 50(6): 955-980 (2003) |
| 2002 |
|---|
| 41 | EE | Marie-Pierre Béal,
Dominique Perrin:
On the Enumerative Sequences of Regular Languages on k Symbols.
STACS 2002: 547-558 |
| 2000 |
|---|
| 40 | EE | 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) |
| 1999 |
|---|
| 39 | EE | Véronique Bruyère,
Dominique Perrin:
Maximal Bifix Codes.
Theor. Comput. Sci. 218(1): 107-121 (1999) |
| 38 | EE | 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) |
| 1998 |
|---|
| 37 | EE | Frédérique Bassino,
Marie-Pierre Béal,
Dominique Perrin:
Super-State Automata and Rational Trees.
LATIN 1998: 42-52 |
| 1997 |
|---|
| 36 | | Olivier Carton,
Dominique Perrin:
The Wadge-Wagner Hierarchy of omega-Rational Sets.
ICALP 1997: 17-35 |
| 35 | | Frédérique Bassino,
Marie-Pierre Béal,
Dominique Perrin:
Enumerative Sequences of Leaves in Rational Trees.
ICALP 1997: 76-86 |
| 1995 |
|---|
| 34 | | Dominique Perrin:
Symbolic Dynamics and Finite Automata.
MFCS 1995: 94-104 |
| 1994 |
|---|
| 33 | | Dominique Perrin:
Automata on Infinite Words (Abstract).
IFIP Congress (1) 1994: 491-492 |
| 1993 |
|---|
| 32 | | Joëlle Cohen,
Dominique Perrin,
Jean-Eric Pin:
On the Expressive Power of Temporal Logic.
J. Comput. Syst. Sci. 46(3): 271-294 (1993) |
| 31 | | Jonathan Ashley,
Brian Marcus,
Dominique Perrin,
Selim Tuncel:
Surjective Extensions of Sliding-Block Codes.
SIAM J. Discrete Math. 6(4): 582-611 (1993) |
| 1992 |
|---|
| 30 | | Georges Hansel,
Dominique Perrin,
Imre Simon:
Compression and Entropy.
STACS 1992: 515-528 |
| 29 | | Dominique Perrin:
On Positive Matrices.
Theor. Comput. Sci. 94(2): 357-366 (1992) |
| 1991 |
|---|
| 28 | EE | Maxime Crochemore,
Dominique Perrin:
Two-Way String Matching.
J. ACM 38(3): 651-675 (1991) |
| 1990 |
|---|
| 27 | | Dominique Perrin:
Finite Automata.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 1-57 |
| 1989 |
|---|
| 26 | | Maurice Gross,
Dominique Perrin:
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
Springer 1989 |
| 25 | | Dominique Perrin:
Partial Commutations.
ICALP 1989: 637-651 |
| 24 | | Georges Hansel,
Dominique Perrin:
Rational Probability Measures.
Theor. Comput. Sci. 65(2): 171-188 (1989) |
| 1988 |
|---|
| 23 | | Maxime Crochemore,
Dominique Perrin:
Critical factorizations of words.
Bulletin of the EATCS 34: 47-51 (1988) |
| 1986 |
|---|
| 22 | | Dominique Perrin:
Local Maps.
Automata Networks 1986: 29-41 |
| 21 | | Dominique Perrin,
Paul E. Schupp:
Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories
LICS 1986: 301-304 |
| 20 | | Dominique Perrin,
Jean-Eric Pin:
First-Order Logic and Star-Free Sets.
J. Comput. Syst. Sci. 32(3): 393-406 (1986) |
| 1985 |
|---|
| 19 | | Maurice Nivat,
Dominique Perrin:
Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique, Le Mont Dore, May 14-18, 1984
Springer 1985 |
| 18 | | Dominique Perrin:
On the solution of Ehrenfeucht's conjecture.
Bulletin of the EATCS 27: 68-70 (1985) |
| 17 | | Robert Cori,
Dominique Perrin:
Automates et Commutations Partielles.
ITA 19(1): 21-32 (1985) |
| 16 | | Danièle Beauquier,
Dominique Perrin:
Codeterministic Automata on Infinite Words.
Inf. Process. Lett. 20(2): 95-98 (1985) |
| 1984 |
|---|
| 15 | | Dominique Perrin:
An introduction to finite automata on infinite words.
Automata on Infinite Words 1984: 2-17 |
| 14 | | Dominique Perrin:
Recent Results on Automata and Infinite Words.
MFCS 1984: 134-148 |
| 13 | | Dominique Perrin:
Completing Biprefix Codes.
Theor. Comput. Sci. 28: 329-336 (1984) |
| 12 | | Dominique Perrin,
Paul E. Schupp:
Sur les Monoides À un Relateur qui sont des Groupes.
Theor. Comput. Sci. 33: 331-334 (1984) |
| 1983 |
|---|
| 11 | | Dominique Perrin:
Varietes de Semigroupes et Mots Infinis.
ICALP 1983: 610-616 |
| 10 | | Georges Hansel,
Dominique Perrin:
Codes and Bernoulli Partitions.
Mathematical Systems Theory 16(2): 133-157 (1983) |
| 1982 |
|---|
| 9 | | Dominique Perrin:
Completing Biprefix Codes.
ICALP 1982: 397-406 |
| 8 | | Maurice Nivat,
Dominique Perrin:
Ensembles Reconnaissables de Mots Biinfinis
STOC 1982: 47-59 |
| 1981 |
|---|
| 7 | EE | Gerard Lallement,
Dominique Perrin:
A graph covering construction of all the finite complete biprefix codes.
Discrete Mathematics 36(3): 261-271 (1981) |
| 1979 |
|---|
| 6 | | Dominique Perrin:
La Representation Ergodique d'un Automate fini.
Theor. Comput. Sci. 9: 221-241 (1979) |
| 1978 |
|---|
| 5 | | Dominique Perrin:
Le degré minimal du groupe d'un code bipréfixe fini.
J. Comb. Theory, Ser. A 25(2): 163-173 (1978) |
| 1976 |
|---|
| 4 | | Dominique Perrin:
Sur la longeur moyenne des codes préfixes.
ICALP 1976: 45-51 |
| 3 | | Dominique Perrin:
The Characteristic Polynomial of a Finite Automaton.
MFCS 1976: 453-457 |
| 1972 |
|---|
| 2 | | Dominique Perrin:
Codes conjugués
Information and Control 20(3): 222-231 (1972) |
| 1971 |
|---|
| 1 | | Dominique Perrin,
Jean-François Perrot:
Congruences et Automorphismes des Automates Finis
Acta Inf. 1: 159-172 (1971) |
