Dominique Perrin
Publications
Publications
|
|
The palindromization mapDiscrete Applied Mathematics, 2023, 340, pp.202-214. ⟨10.1016/J.DAM.2023.07.008⟩ |
|
|
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⟩ |
|
|
Graded alphabets, circular codes, free Lie algebras and comma-free codesDiscrete Mathematics, 2021, 344 (1), ⟨10.1016/j.disc.2020.112167⟩ |
|
|
On the group of a rational maximal bifix codeForum Mathematicum, 2020, 32 (3), pp.553-576. ⟨10.1515/forum-2018-0270⟩ |
|
|
Eventually dendric shiftsErgodic Theory and Dynamical Systems, 2020, ⟨10.1017/etds.2020.35⟩ |
|
|
Rigidity and Substitutive Dendric WordsInternational Journal of Foundations of Computer Science, 2018, 29 (05), pp.705-720. ⟨10.1142/S0129054118420017⟩ |
|
|
A Survey on Difference Hierarchies of Regular LanguagesLogical Methods in Computer Science, 2018, 14, pp.1 - 23. ⟨10.23638/LMCS-14(1:24)2018⟩ |
|
|
Birecurrent setsInternational Journal of Algebra and Computation, 2018, 28 (04), pp.613-652. ⟨10.1142/S0218196718500285⟩ |
|
|
Hall sets, Lazard sets and comma-free codesDiscrete Mathematics, 2018, 341 (1), pp.232-243. ⟨10.1016/j.disc.2017.08.034⟩ |
|
|
Neutral and tree sets of arbitrary characteristicTheoretical Computer Science, 2017, 658 (part A), pp.159-174. ⟨10.1016/j.tcs.2016.01.008⟩ |
|
|
Theoretical Computer ScienceTheoretical Computer Science, 2017, 684 (05), pp.3-28. ⟨10.1016/j.tcs.2017.03.001⟩ |
|
|
Return words of linear involutions and fundamental groupsErgodic Theory and Dynamical Systems, 2017, 37 (3), pp.693-715. ⟨10.1017/etds.2015.74⟩ |
|
|
Maximal bifix decodingContributions to Discrete Mathematics, 2015, 338 (5), pp.725-742. ⟨10.1016/j.disc.2014.12.010⟩ |
|
|
The finite index basis propertyJournal of Pure and Applied Algebra, 2015, ⟨10.1016/j.jpaa.2014.09.014⟩ |
|
|
Bifix codes and interval exchangesJournal of Pure and Applied Algebra, 2015, ⟨10.1016/j.jpaa.2014.09.028⟩ |
|
|
A quadratic algorithm for road coloringDiscrete Applied Mathematics, 2014, 169 (-), pp.15-29. ⟨10.1016/j.dam.2013.12.002⟩ |
|
|
Acyclic, connected and tree setsMonatshefte für Mathematik, 2014, ⟨10.1007/s00605-014-0721-4⟩ |
|
|
Discrete mathematical structures: From dynamics to complexityTheoretical Computer Science, 2013, 504, pp.3-4. ⟨10.1016/j.tcs.2013.09.001⟩ |
|
|
Completely reducible setsInternational Journal of Algebra and Computation, 2013, 23 (4), pp.915-942. ⟨10.1142/S0218196713400158⟩ |
|
|
Bifix codes and Sturmian wordsJournal of Algebra, 2012, 369 (1), pp.146-202. ⟨10.1016/j.jalgebra.2012.07.013⟩ |
|
|
Recent results on syntactic groups of prefix codesEuropean Journal of Combinatorics, 2012, 33 (7), pp.1386-1401 |
|
|
A note on Sturmian wordsTheoretical Computer Science, 2012, 429 (1), pp.265-272. ⟨10.1016/j.tcs.2011.12.047⟩ |
|
|
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⟩ |
|
|
Embeddings of local automataIllinois Journal of Mathematics, 2010, 54 (1), pp.155-174 |
|
|
On the groups of codes with empty kernelSemigroup Forum, 2010, 80 (3), pp.351-374 |
|
|
Codes and noncommutative stochastic matricesJournal of Noncommutative Geometry, 2010, 4 (4), pp.531-554. ⟨10.4171/JNCG/65⟩ |
|
|
Completing codes in a sofic shiftTheoretical Computer Science, 2009, 410 (43), pp.4423-4431 |
Unambiguous automataMathematics in Computer Science, 2008, 1 (4), pp.625-638 |
|
The origins of combinatorics on wordsEuropean Journal of Combinatorics, 2007, 28 (3), pp.996-1022 |
|
|
|
Codes, unambiguous automata and sofic systemsTheoretical Computer Science, 2006, 356 (1-2), pp.6-13 |
|
|
The syntactic graph of a sofic shift is invariant under shift equivalenceInternational Journal of Algebra and Computation, 2006, 16 (3), pp.443-460 |
|
|
Codes and sofic constraintsTheoretical Computer Science, 2005, 340 (2), pp.381-393 |
A hierarchy of shift equivalent sofic shiftsTheoretical Computer Science, 2005, 345 (2-3), pp.390-205 |
|
|
|
A note on the Burrows-Wheeler transformationTheoretical Computer Science, 2005, 332 (1-3), pp.567-572. ⟨10.1016/j.tcs.2004.11.014⟩ |
|
|
Unavoidable sets of constant lengthInternational Journal of Algebra and Computation, 2004, 14 (1), pp.241-251. ⟨10.1142/S0218196704001700⟩ |
|
|
On the generating sequences of regular languages on k-symbolsJournal of the ACM (JACM), 2003, 50 (6), pp.955-980. ⟨10.1145/950620.950625⟩ |
Ensembles inévitablesSeminaire Lotharingien de Combinatoire, 2002, 47 (B47e), pp.16 |
|
|
|
A weak equivalence between shifts of finite typeAdvances in Applied Mathematics, 2002, 29 (2), pp.162-171 |
|
|
Les automates finisRevue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, 2000, 19 (3), pp.395-402 |
|
|
A finite state version of the Kraft-McMillan theoremSIAM Journal on Computing, 2000, 30 (4), pp.1211-1230 |
|
|
Enumerative sequences of leaves and nodes in rational treesTheoretical Computer Science, 1999, 221 (1-2), pp.41-60 |
OuvertureTravaux et Recherches de l'UMLV, 1999, pp.4 |
|
|
|
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 |
|
|
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⟩ |
Two-way string-matchingJ. Assoc. Comput. Mach., 1991, 38 (3), pp.651-675 |
|
Critical factorizations of wordsBulletin- European Association for Theoretical Computer Science, 1988, 34 (1), pp.47-52 |
|
Une caractérisation des ensembles sofiquesComptes rendus de l'Académie des sciences. Série I, Mathématique, 1986, 303 (6), pp.255-257 |
|
Trends in the theory of codesBulletin- European Association for Theoretical Computer Science, 1986, 29 (1), pp.84-95 |
|
|
The Degree of a Finite Set of WordsFSTTCS 2020, Dec 2020, Goa (online), India. pp.54:1-54:16, ⟨10.4230/LIPICS.FSTTCS.2020.54⟩ |
|
|
Return Words and Bifix Codes in Eventually Dendric SetsWORDS 2019 12th International Conference Combinatorics on Words, Sep 2019, Loughborough, United Kingdom. pp.167-179, ⟨10.1007/978-3-030-28796-2_13⟩ |
|
|
Groups, Languages and Dendric Shifts22nd International Conference Developments in Language Theory ( DLT 2018 ), Sep 2018, Tokyo, France. pp.60-73, ⟨10.1007/978-3-319-98654-8_5⟩ |
|
|
Specular SetsWORDS 2015, Sep 2015, Kiel, Germany. pp.210-222, ⟨10.1007/978-3-319-23660-5_18⟩ |
|
|
Codes and automata in minimal setsWORDS 2015, Sep 2015, Kiel, Germany. pp.35-46, ⟨10.1007/978-3-319-23660-5_4⟩ |
|
|
Toward a timed theory of channel codingFORMATS, 2012, United Kingdom. pp.27-42, ⟨10.1007/978-3-642-33365-1_4⟩ |
|
|
Generating functions of timed languagesMFCS 2012, Aug 2012, Bratislava, Slovakia. pp.124-135, ⟨10.1007/978-3-642-32589-2_14⟩ |
|
|
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⟩ |
|
|
Embeddings of local automataIEEE International Symposium on Information Theory (ISIT'08), Jul 2008, United States. pp.2351-2355 |
Road ColoringLondon Stringology Days and Algorithmic Workshop, 2008, France |
|
Variants of the road coloring problemJournées Montoises d'Informatique Théorique, 2008, France |
|
Embeddings of automataAutoMathA, 2007, France |
|
Theory and practice: the applications of combinatorics on wordsSTIC-AMSUD, Oct 2006, France |
|
|
|
The syntactic graph of a sofic shift21st International Symposium on Theoretical Aspects of Computer Science (STACS 2004), Mar 2004, Montpellier, France. pp.282-293 |
|
|
A hierarchy of irreducible sofic shifts29th International Symposium on Mathematical Foundations of Computer Science 2004, 2004, Czech Republic. pp.611-622 |
|
|
Complete codes in a sofic shift19th International Symposium on Theoretical Aspects of Computer Science (STACS 2002), 2002, France. pp.547-558 |
|
|
Length distributions and regular sequencesCodes, systems, and graphical models (Minneapolis, MN, 1999), 2001, United States. pp.415-437 |
|
|
Super-state automata and rational trees3rd Latin American Theoretical INformatics (LATIN'98), Apr 1998, Campinas, Brazil. pp.42-52 |
Enumerative sequences of leaves in rational treesInternational Colloquium on Automata, Languages and Programming (ICALP 1997), 1997, Italy. pp.76-86 |
|
Pattern matching in stringsProceedings of the 4th conference on Image Analysis and Processing (Cefalù, 1988), 1988, France. pp.67-79 |
|
|
Dimension Groups and Dynamical SystemsCambridge University Press, 196, 2022, Cambridge Studies in Advanced Mathematics, ⟨10.1017/9781108976039⟩ |
Codes and AutomataCambridge University Press, 129, 619pp., 2009, Encyclopedia of Mathematics and its Applications |
|
Applied Combinatorics on WordsCambridge University Press, 105, 610pp., 2005, Encyclopedia of Mathematics and its Applications |
|
Infinite Words: Automata, Semigroups, Logic and GamesElsevier, pp.538, 2004 |
|
Infinite Words, Automata, Semigroups, Logic and GamesElsevier, 141, 550pp., 2004 |
|
Theory of codesAcademic Press Inc., 117, pp.xiv+433, 1985, Pure and Applied Mathematics |
|
|
Symbolic dynamicsJean-Éric Pin. Handbook of Automata Theory, 2 (1), EMS Press, pp.987-1030, 2021, ⟨10.4171/AUTOMATA-2/5⟩ |
Enumerative combinatorics on wordsMiklos Bona. Handbook of Enumerative Combinatorics, CRC Press, 2015, 9781482220858 |
|
|
|
Enumeration Formulæ in Neutral SetsDevelopments in Language Theory, 2015, ⟨10.1007/978-3-319-21500-6_17⟩ |
|
|
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 |
|
|
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 |
Automi e linguaggi formaliPetruccioli Sandro. Storia della Scienza, IX, Istituto della Enciclopedia Italiana, pp.197-205, 2003 |
|
Finite and infinite wordsLothaire M. Algebraic Combinatorics on Words, Cambridge University Press, pp.1-39, 2002 |
|
|
|
Enumerative combinatorics on wordsCrapo Henri, Rota Gian-Carlo. Algebraic Combinatorics and Computer Science, Springer-Verlag, pp.391-430, 2001 |
Chapter 10: Symbolic dynamics and finite automataRosenberg G., Salomaa A. Handbook of formal languages, 2, Springer-Verlag, pp.463-505, 1997 |
|
Les automates finis?. Le Courrier du C.N.R.S., la recherche en informatique, C.N.R.S., pp.48-51, 1993 |
On the synchronization delay of local automata2007 |
|
|
Decidable problems in substitution shifts2023 |
|
|
On The Dimension Group of Unimodular S-Adic Subshifts2020 |
|
|
Profinite semigroups2017 |
|
|
Interval exchanges, admissibility and branching Rauzy induction2016 |
|
|
Embeddings of automata2007 |