Dominique Perrin

According to our database1, Dominique Perrin
  • authored at least 89 papers between 1970 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Neutral and tree sets of arbitrary characteristic.
Theor. Comput. Sci., 2017

Specular sets.
Theor. Comput. Sci., 2017

Profinite semigroups.
CoRR, 2017

Recurrent and birecurrent sets.
CoRR, 2017

A survey on difference hierarchies of regular languages.
CoRR, 2017

2015
Maximal bifix decoding.
Discrete Mathematics, 2015

Enumeration formulæ in neutral sets.
CoRR, 2015

Specular sets.
CoRR, 2015

Enumeration Formulæ in Neutral Sets.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Codes and Automata in Minimal Sets.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

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

2014
A quadratic algorithm for road coloring.
Discrete Applied Mathematics, 2014

2013
Discrete mathematical structures: From dynamics to complexity.
Theor. Comput. Sci., 2013

Completely Reducible Sets.
IJAC, 2013

Bifix codes and the finite index basis property
CoRR, 2013

Return words in interval exchange transformations
CoRR, 2013

Bifix codes in acyclic sets.
CoRR, 2013

2012
A note on Sturmian words.
Theor. Comput. Sci., 2012

Recent results on syntactic groups of prefix codes.
Eur. J. Comb., 2012

Completely reducible sets
CoRR, 2012

Generating Functions of Timed Languages.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Toward a Timed Theory of Channel Coding.
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.
Int. J. Found. Comput. Sci., 2011

2010
Bifix codes and Sturmian words
CoRR, 2010

Symbolic dynamics
CoRR, 2010

2009
Completing codes in a sofic shift.
Theor. Comput. Sci., 2009

A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008
Unambiguous Automata.
Mathematics in Computer Science, 2008

Codes and Noncommutative Stochastic Matrices
CoRR, 2008

A quadratic algorithm for road coloring
CoRR, 2008

Embeddings of local automata.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

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

2007
The origins of combinatorics on words.
Eur. J. Comb., 2007

2006
Codes, unambiguous automata and sofic systems.
Theor. Comput. Sci., 2006

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

Complete Codes in a Sofic Shift.
Proceedings of the STACS 2006, 2006

2005
Preface.
Theor. Comput. Sci., 2005

A note on the Burrows - CWheeler transformation.
Theor. Comput. Sci., 2005

Parsing with a finite dictionary.
Theor. Comput. Sci., 2005

Codes and sofic constraints.
Theor. Comput. Sci., 2005

A hierarchy of shift equivalent sofic shifts.
Theor. Comput. Sci., 2005

A note on the Burrows-Wheeler transformation
CoRR, 2005

2004
Unavoidable Sets of Constant Length.
IJAC, 2004

The Syntactic Graph of a Sofic Shift.
Proceedings of the STACS 2004, 2004

A Hierarchy of Irreducible Sofic Shifts.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003
On the generating sequences of regular languages on k symbols.
J. ACM, 2003

2002
On the Enumerative Sequences of Regular Languages on k Symbols.
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.
SIAM J. Comput., 2000

1999
Maximal Bifix Codes.
Theor. Comput. Sci., 1999

Enumerative Sequences of Leaves and Nodes in Rational Trees.
Theor. Comput. Sci., 1999

The Wagner Hierarchy.
IJAC, 1999

1998
Super-State Automata and Rational Trees.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

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

The Wadge-Wagner Hierarchy of omega-Rational Sets.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Enumerative Sequences of Leaves in Rational Trees.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1995
Symbolic Dynamics and Finite Automata.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1994
Automata on Infinite Words (Abstract).
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.
SIAM J. Discrete Math., 1993

On the Expressive Power of Temporal Logic.
J. Comput. Syst. Sci., 1993

1992
On Positive Matrices.
Theor. Comput. Sci., 1992

Compression and Entropy.
Proceedings of the STACS 92, 1992

1991
Two-Way String Matching.
J. ACM, 1991

1990
Finite Automata.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), 1990

1989
Rational Probability Measures.
Theor. Comput. Sci., 1989

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

1988
Critical factorizations of words.
Bulletin of the EATCS, 1988

1986
First-Order Logic and Star-Free Sets.
J. Comput. Syst. Sci., 1986

Local Maps.
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
Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

1985
Automates et Commutations Partielles.
ITA, 1985

Codeterministic Automata on Infinite Words.
Inf. Process. Lett., 1985

On the solution of Ehrenfeucht's conjecture.
Bulletin of the EATCS, 1985

1984
Sur les Monoides À un Relateur qui sont des Groupes.
Theor. Comput. Sci., 1984

Completing Biprefix Codes.
Theor. Comput. Sci., 1984

Recent Results on Automata and Infinite Words.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

An introduction to finite automata on infinite words.
Proceedings of the Automata on Infinite Words, 1984

1983
Codes and Bernoulli Partitions.
Mathematical Systems Theory, 1983

Varietes de Semigroupes et Mots Infinis.
Proceedings of the Automata, 1983

1982
Ensembles Reconnaissables de Mots Biinfinis
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

Completing Biprefix Codes.
Proceedings of the Automata, 1982

1981
A graph covering construction of all the finite complete biprefix codes.
Discrete Mathematics, 1981

1979
La Representation Ergodique d'un Automate fini.
Theor. Comput. Sci., 1979

Synchronization and simplification.
Discrete Mathematics, 1979

1978
Le degré minimal du groupe d'un code bipréfixe fini.
J. Comb. Theory, Ser. A, 1978

1976
The Characteristic Polynomial of a Finite Automaton.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

Sur la longeur moyenne des codes préfixes.
ICALP, 1976

1972
Codes conjugués
Information and Control, April, 1972

1971
Congruences et Automorphismes des Automates Finis.
Acta Inf., 1971

1970
Le langage engendre par un code prefixe et son monoide syntaxique.
PhD thesis, 1970


  Loading...