Dominique Perrin
84
Documents
Publications
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 27
- 13
- 11
- 10
- 9
- 7
- 6
- 6
- 5
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 80
- 7
- 1
- 1
- 2
- 2
- 1
|
On the dimension group of unimodular ${\mathcal {S}}$-adic subshiftsMonatshefte für Mathematik, 2021, 194 (4), pp.687-717. ⟨10.1007/s00605-020-01488-3⟩
Journal articles
hal-03134044v1
|
|
Graded alphabets, circular codes, free Lie algebras and comma-free codesDiscrete Mathematics, 2021, 344 (1), ⟨10.1016/j.disc.2020.112167⟩
Journal articles
hal-03134035v1
|
On the group of a rational maximal bifix codeForum Mathematicum, 2020, 32 (3), pp.553-576. ⟨10.1515/forum-2018-0270⟩
Journal articles
hal-03226871v1
|
|
|
Eventually dendric shiftsErgodic Theory and Dynamical Systems, 2020, ⟨10.1017/etds.2020.35⟩
Journal articles
hal-03134086v1
|
|
A Survey on Difference Hierarchies of Regular LanguagesLogical Methods in Computer Science, 2018, 14, pp.1 - 23. ⟨10.23638/LMCS-14(1:24)2018⟩
Journal articles
hal-02104436v1
|
Birecurrent setsInternational Journal of Algebra and Computation, 2018, 28 (04), pp.613-652. ⟨10.1142/S0218196718500285⟩
Journal articles
hal-03134002v1
|
|
|
Rigidity and Substitutive Dendric WordsInternational Journal of Foundations of Computer Science, 2018, 29 (05), pp.705-720. ⟨10.1142/S0129054118420017⟩
Journal articles
hal-02458711v1
|
Hall sets, Lazard sets and comma-free codesDiscrete Mathematics, 2018, 341 (1), pp.232-243. ⟨10.1016/j.disc.2017.08.034⟩
Journal articles
hal-01804538v1
|
|
Theoretical Computer ScienceTheoretical Computer Science, 2017, 684 (05), pp.3-28. ⟨10.1016/j.tcs.2017.03.001⟩
Journal articles
hal-02364465v1
|
|
|
Return words of linear involutions and fundamental groupsErgodic Theory and Dynamical Systems, 2017, 37 (3), pp.693-715. ⟨10.1017/etds.2015.74⟩
Journal articles
hal-01367712v1
|
|
Neutral and tree sets of arbitrary characteristicTheoretical Computer Science, 2017, 658 (part A), pp.159-174. ⟨10.1016/j.tcs.2016.01.008⟩
Journal articles
hal-01367718v1
|
|
The finite index basis propertyJournal of Pure and Applied Algebra, 2015, ⟨10.1016/j.jpaa.2014.09.014⟩
Journal articles
hal-01367681v1
|
|
Maximal bifix decodingContributions to Discrete Mathematics, 2015, 338 (5), pp.725-742. ⟨10.1016/j.disc.2014.12.010⟩
Journal articles
hal-01121880v1
|
|
Bifix codes and interval exchangesJournal of Pure and Applied Algebra, 2015, ⟨10.1016/j.jpaa.2014.09.028⟩
Journal articles
hal-01367685v1
|
|
A quadratic algorithm for road coloringDiscrete Applied Mathematics, 2014, 169 (-), pp.15-29. ⟨10.1016/j.dam.2013.12.002⟩
Journal articles
hal-00627821v2
|
|
Acyclic, connected and tree setsMonatshefte für Mathematik, 2014, ⟨10.1007/s00605-014-0721-4⟩
Journal articles
hal-01121887v1
|
|
Completely reducible setsInternational Journal of Algebra and Computation, 2013, 23 (4), pp.915-942. ⟨10.1142/S0218196713400158⟩
Journal articles
hal-00790760v1
|
Discrete mathematical structures: From dynamics to complexityTheoretical Computer Science, 2013, 504, pp.3-4. ⟨10.1016/j.tcs.2013.09.001⟩
Journal articles
lirmm-01480616v1
|
|
|
Bifix codes and Sturmian wordsJournal of Algebra, 2012, 369 (1), pp.146-202. ⟨10.1016/j.jalgebra.2012.07.013⟩
Journal articles
hal-00793907v1
|
|
A note on Sturmian wordsTheoretical Computer Science, 2012, 429 (1), pp.265-272. ⟨10.1016/j.tcs.2011.12.047⟩
Journal articles
hal-00828351v1
|
|
Recent results on syntactic groups of prefix codesEuropean Journal of Combinatorics, 2012, 33 (7), pp.1386-1401
Journal articles
hal-00790638v1
|
|
A quadratic upper bound on the size of a synchronizing word in one-cluster automataInternational Journal of Foundations of Computer Science, 2011, 22 (2), pp.277-288. ⟨10.1142/S0129054111008039⟩
Journal articles
hal-00619778v1
|
|
On the groups of codes with empty kernelSemigroup Forum, 2010, 80 (3), pp.351-374
Journal articles
hal-00790630v1
|
|
Codes and noncommutative stochastic matricesJournal of Noncommutative Geometry, 2010, 4 (4), pp.531-554. ⟨10.4171/JNCG/65⟩
Journal articles
hal-00793906v1
|
|
Embeddings of local automataIllinois Journal of Mathematics, 2010, 54 (1), pp.155-174
Journal articles
hal-00619770v1
|
|
Completing codes in a sofic shiftTheoretical Computer Science, 2009, 410 (43), pp.4423-4431
Journal articles
hal-00619734v1
|
Unambiguous automataMathematics in Computer Science, 2008, 1 (4), pp.625-638
Journal articles
hal-00619733v1
|
|
The origins of combinatorics on wordsEuropean Journal of Combinatorics, 2007, 28 (3), pp.996-1022
Journal articles
hal-00619483v1
|
|
|
Codes, unambiguous automata and sofic systemsTheoretical Computer Science, 2006, 356 (1-2), pp.6-13
Journal articles
hal-00619226v1
|
|
The syntactic graph of a sofic shift is invariant under shift equivalenceInternational Journal of Algebra and Computation, 2006, 16 (3), pp.443-460
Journal articles
hal-00619735v1
|
|
Codes and sofic constraintsTheoretical Computer Science, 2005, 340 (2), pp.381-393
Journal articles
hal-00619227v1
|
A hierarchy of shift equivalent sofic shiftsTheoretical Computer Science, 2005, 345 (2-3), pp.390-205
Journal articles
hal-00619229v1
|
|
|
A note on the Burrows-Wheeler transformationTheoretical Computer Science, 2005, 332 (1-3), pp.567-572. ⟨10.1016/j.tcs.2004.11.014⟩
Journal articles
hal-00004249v1
|
|
Unavoidable sets of constant lengthInternational Journal of Algebra and Computation, 2004, 14 (1), pp.241-251. ⟨10.1142/S0218196704001700⟩
Journal articles
hal-00619542v1
|
|
On the generating sequences of regular languages on k-symbolsJournal of the ACM (JACM), 2003, 50 (6), pp.955-980. ⟨10.1145/950620.950625⟩
Journal articles
hal-00619228v1
|
|
A weak equivalence between shifts of finite typeAdvances in Applied Mathematics, 2002, 29 (2), pp.162-171
Journal articles
hal-00619322v1
|
Ensembles inévitablesSeminaire Lotharingien de Combinatoire, 2002, 47 (B47e), pp.16
Journal articles
hal-00321348v1
|
|
|
A finite state version of the Kraft-McMillan theoremSIAM Journal on Computing, 2000, 30 (4), pp.1211-1230
Journal articles
hal-00619334v1
|
|
Les automates finisRevue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, 2000, 19 (3), pp.395-402
Journal articles
hal-00793910v1
|
OuvertureTravaux et Recherches de l'UMLV, 1999, pp.4
Journal articles
hal-03780268v1
|
|
|
Enumerative sequences of leaves and nodes in rational treesTheoretical Computer Science, 1999, 221 (1-2), pp.41-60
Journal articles
hal-00619336v1
|
|
Les débuts de la théorie des automatesRevue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, 1995, 14 (4), pp.409-433
Journal articles
hal-00793909v1
|
|
On the expressive power of temporal logic for finite wordsJournal of Computer and System Sciences, 1993, 46, pp.271-294. ⟨10.1016/0022-0000(93)90005-H⟩
Journal articles
hal-00020069v1
|
Two-way string-matchingJ. Assoc. Comput. Mach., 1991, 38 (3), pp.651-675
Journal articles
hal-00619582v1
|
|
Critical factorizations of wordsBulletin- European Association for Theoretical Computer Science, 1988, 34 (1), pp.47-52
Journal articles
hal-00619591v1
|
|
Trends in the theory of codesBulletin- European Association for Theoretical Computer Science, 1986, 29 (1), pp.84-95
Journal articles
hal-00619484v1
|
|
Une caractérisation des ensembles sofiquesComptes rendus de l'Académie des sciences. Série I, Mathématique, 1986, 303 (6), pp.255-257
Journal articles
hal-00619328v1
|
|
Codes and automata in minimal setsWORDS 2015, Sep 2015, Kiel, Germany. pp.35-46, ⟨10.1007/978-3-319-23660-5_4⟩
Conference papers
hal-01855957v1
|
|
Specular SetsWORDS 2015, Sep 2015, Kiel, Germany. pp.210-222, ⟨10.1007/978-3-319-23660-5_18⟩
Conference papers
hal-01367700v1
|
|
Toward a timed theory of channel codingFORMATS, 2012, United Kingdom. pp.27-42, ⟨10.1007/978-3-642-33365-1_4⟩
Conference papers
hal-00793143v1
|
|
Generating functions of timed languagesMFCS 2012, Aug 2012, Bratislava, Slovakia. pp.124-135, ⟨10.1007/978-3-642-32589-2_14⟩
Conference papers
hal-00678443v2
|
|
A quadratic upper bound on the size of a synchronizing word in one-cluster automata13th International Conference on Developments in Language Theory (DLT 2009), Jun 2009, Stuttgart, Germany. pp.81-90, ⟨10.1007/978-3-642-02737-6_6⟩
Conference papers
hal-00620310v1
|
|
Embeddings of local automataIEEE International Symposium on Information Theory (ISIT'08), Jul 2008, United States. pp.2351-2355
Conference papers
hal-00620271v1
|
Variants of the road coloring problemJournées Montoises d'Informatique Théorique, 2008, France
Conference papers
hal-00620455v1
|
|
Road ColoringLondon Stringology Days and Algorithmic Workshop, 2008, France
Conference papers
hal-00620456v1
|
|
Embeddings of automataAutoMathA, 2007, France
Conference papers
hal-00620457v1
|
|
Theory and practice: the applications of combinatorics on wordsSTIC-AMSUD, Oct 2006, France
Conference papers
hal-00620454v1
|
|
|
A hierarchy of irreducible sofic shifts29th International Symposium on Mathematical Foundations of Computer Science 2004, 2004, Czech Republic. pp.611-622
Conference papers
hal-00619854v1
|
|
The syntactic graph of a sofic shift21st International Symposium on Theoretical Aspects of Computer Science (STACS 2004), Mar 2004, Montpellier, France. pp.282-293
Conference papers
hal-00619853v1
|
|
Complete codes in a sofic shift19th International Symposium on Theoretical Aspects of Computer Science (STACS 2002), 2002, France. pp.547-558
Conference papers
hal-00619856v1
|
|
Length distributions and regular sequencesCodes, systems, and graphical models (Minneapolis, MN, 1999), 2001, United States. pp.415-437
Conference papers
hal-00619863v1
|
|
Super-state automata and rational trees3rd Latin American Theoretical INformatics (LATIN'98), Apr 1998, Campinas, Brazil. pp.42-52
Conference papers
hal-00619862v1
|
Enumerative sequences of leaves in rational treesInternational Colloquium on Automata, Languages and Programming (ICALP 1997), 1997, Italy. pp.76-86
Conference papers
hal-00619864v1
|
|
Pattern matching in stringsProceedings of the 4th conference on Image Analysis and Processing (Cefalù, 1988), 1988, France. pp.67-79
Conference papers
hal-00619999v1
|
Dimension Groups and Dynamical SystemsCambridge University Press, 196, 2022, Cambridge Studies in Advanced Mathematics, ⟨10.1017/9781108976039⟩
Books
hal-03746074v1
|
|
Codes and AutomataCambridge University Press, 129, 619pp., 2009, Encyclopedia of Mathematics and its Applications
Books
hal-00620616v1
|
|
Applied Combinatorics on WordsCambridge University Press, 105, 610pp., 2005, Encyclopedia of Mathematics and its Applications
Books
hal-00620613v1
|
|
Infinite Words: Automata, Semigroups, Logic and GamesElsevier, pp.538, 2004
Books
hal-00112831v1
|
|
Infinite Words, Automata, Semigroups, Logic and GamesElsevier, 141, 550pp., 2004
Books
hal-00619830v1
|
|
Theory of codesAcademic Press Inc., 117, pp.xiv+433, 1985, Pure and Applied Mathematics
Books
hal-00619780v1
|
Enumerative combinatorics on wordsMiklos Bona. Handbook of Enumerative Combinatorics, CRC Press, 2015, 9781482220858
Book sections
hal-01121901v1
|
|
|
Enumeration Formulæ in Neutral SetsDevelopments in Language Theory, 2015, ⟨10.1007/978-3-319-21500-6_17⟩
Book sections
hal-01367707v1
|
|
Variable-length codes and finite automataI. Woungang, S. Misra et S. Chandra Misra. Selected Topics in Information and Coding Theory, World Scientific, pp.505-584, 2010, Series on Coding Theory and Cryptology, 978-981-283-716-5
Book sections
hal-00620817v1
|
|
Automata and semigroups recognizing infinite wordsJ. Flum, E. Grädel and T. Wilke. Logic and Automata, History and perspectives, Amsterdam University Press, pp.585-596, 2007
Book sections
hal-00340797v1
|
Automi e linguaggi formaliPetruccioli Sandro. Storia della Scienza, IX, Istituto della Enciclopedia Italiana, pp.197-205, 2003
Book sections
hal-00620806v1
|
|
Finite and infinite wordsLothaire M. Algebraic Combinatorics on Words, Cambridge University Press, pp.1-39, 2002
Book sections
hal-00620767v1
|
|
|
Enumerative combinatorics on wordsCrapo Henri, Rota Gian-Carlo. Algebraic Combinatorics and Computer Science, Springer-Verlag, pp.391-430, 2001
Book sections
hal-00620805v1
|
Chapter 10: Symbolic dynamics and finite automataRosenberg G., Salomaa A. Handbook of formal languages, 2, Springer-Verlag, pp.463-505, 1997
Book sections
hal-00620643v1
|
|
Les automates finis?. Le Courrier du C.N.R.S., la recherche en informatique, C.N.R.S., pp.48-51, 1993
Book sections
hal-00620850v1
|
On the synchronization delay of local automata2007
Other publications
hal-00620452v1
|
|
On The Dimension Group of Unimodular S-Adic Subshifts2020
Preprints, Working Papers, ...
hal-02366494v2
|
Profinite semigroups2017
Preprints, Working Papers, ...
hal-01947235v1
|
|
|
Interval exchanges, admissibility and branching Rauzy induction2016
Preprints, Working Papers, ...
hal-01367715v1
|
|
Embeddings of automata2007
Reports
hal-00627816v1
|