Export Publications

Export the displayed publications:
Number of documents

74

pageDPerrin


Journal articles39 documents

  • Olivier Carton, Dominique Perrin, Jean-Eric Pin. A Survey on Difference Hierarchies of Regular Languages. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2018, 14, pp.1 - 23. ⟨10.23638/LMCS-14(1:24)2018⟩. ⟨hal-02104436⟩
  • Dominique Perrin, Christophe Reutenauer. Hall sets, Lazard sets and comma-free codes. Discrete Mathematics, Elsevier, 2018, 341 (1), pp.232-243. ⟨10.1016/j.disc.2017.08.034⟩. ⟨hal-01804538⟩
  • Valérie Berthé, Vincent Delecroix, Francesco Dolce, Dominique Perrin, Christophe Reutenauer, et al.. Return words of linear involutions and fundamental groups. Ergodic Theory and Dynamical Systems, Cambridge University Press (CUP), 2017, 37 (3), pp.693-715. ⟨10.1017/etds.2015.74⟩. ⟨hal-01367712⟩
  • Francesco Dolce, Dominique Perrin. Neutral and tree sets of arbitrary characteristic. Theoretical Computer Science, Elsevier, 2017, 658 (part A), pp.159-174. ⟨10.1016/j.tcs.2016.01.008⟩. ⟨hal-01367718⟩
  • Valérie Berthé, Clelia de Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, et al.. Maximal bifix decoding. Contributions to Discrete Mathematics, University of Calgary, 2015, 338 (5), pp.725-742. ⟨10.1016/j.disc.2014.12.010⟩. ⟨hal-01121880⟩
  • Valérie Berthé, Clelia de Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, et al.. Bifix codes and interval exchanges. Journal of Pure and Applied Algebra, Elsevier, 2015, ⟨10.1016/j.jpaa.2014.09.028⟩. ⟨hal-01367685⟩
  • Valérie Berthé, Clelia de Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, et al.. The finite index basis property. Journal of Pure and Applied Algebra, Elsevier, 2015, ⟨10.1016/j.jpaa.2014.09.014⟩. ⟨hal-01367681⟩
  • Marie-Pierre Béal, Dominique Perrin. A quadratic algorithm for road coloring. Discrete Applied Mathematics, Elsevier, 2014, 169 (-), pp.15-29. ⟨10.1016/j.dam.2013.12.002⟩. ⟨hal-00627821v2⟩
  • Valérie Berthé, Clelia de Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, et al.. Acyclic, connected and tree sets. Monatshefte für Mathematik, Springer Verlag, 2014, ⟨10.1007/s00605-014-0721-4⟩. ⟨hal-01121887⟩
  • Dominique Perrin. Completely reducible sets. International Journal of Algebra and Computation, World Scientific Publishing, 2013, 23 (4), pp.915-942. ⟨10.1142/S0218196713400158⟩. ⟨hal-00790760⟩
  • Cristian Calude, Bruno Durand, Anahí Gajardo, Dominique Perrin, Ivan Rapaport, et al.. Discrete mathematical structures: From dynamics to complexity. Theoretical Computer Science, Elsevier, 2013, 504, pp.3-4. ⟨10.1016/j.tcs.2013.09.001⟩. ⟨lirmm-01480616⟩
  • Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone. Bifix codes and Sturmian words. Journal of Algebra, Elsevier, 2012, 369 (1), pp.146-202. ⟨10.1016/j.jalgebra.2012.07.013⟩. ⟨hal-00793907⟩
  • Jean Berstel, Clelia de Felice, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone. Recent results on syntactic groups of prefix codes. European Journal of Combinatorics, Elsevier, 2012, 33 (7), pp.1386-1401. ⟨hal-00790638⟩
  • Dominique Perrin, Antonio Restivo. A note on Sturmian words. Theoretical Computer Science, Elsevier, 2012, 429 (1), pp.265-272. ⟨10.1016/j.tcs.2011.12.047⟩. ⟨hal-00828351⟩
  • Marie-Pierre Béal, Mikhail V. Berlinkov, Dominique Perrin. A quadratic upper bound on the size of a synchronizing word in one-cluster automata. International Journal of Foundations of Computer Science, World Scientific Publishing, 2011, 22 (2), pp.277-288. ⟨10.1142/S0129054111008039⟩. ⟨hal-00619778⟩
  • Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin. Embeddings of local automata. Illinois Journal of Mathematics, 2010, 54 (1), pp.155-174. ⟨hal-00619770⟩
  • Sylvain Lavallée, Christophe Reutenauer, Vladimir Retakh, Dominique Perrin. Codes and noncommutative stochastic matrices. Journal of Noncommutative Geometry, European Mathematical Society, 2010, 4 (4), pp.531-554. ⟨10.4171/JNCG/65⟩. ⟨hal-00793906⟩
  • Jean Berstel, Clelia de Felice, Dominique Perrin, Giuseppina Rindone. On the groups of codes with empty kernel. Semigroup Forum, Springer Verlag, 2010, 80 (3), pp.351-374. ⟨hal-00790630⟩
  • Marie-Pierre Béal, Dominique Perrin. Completing codes in a sofic shift. Theoretical Computer Science, Elsevier, 2009, 410 (43), pp.4423-4431. ⟨hal-00619734⟩
  • Marie-Pierre Béal, Eugen Czeizler, Jarkko Kari, Dominique Perrin. Unambiguous automata. Mathematics in Computer Science, Springer, 2008, 1 (4), pp.625-638. ⟨hal-00619733⟩
  • Jean Berstel, Dominique Perrin. The origins of combinatorics on words. European Journal of Combinatorics, Elsevier, 2007, 28 (3), pp.996-1022. ⟨hal-00619483⟩
  • Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin. The syntactic graph of a sofic shift is invariant under shift equivalence. International Journal of Algebra and Computation, World Scientific Publishing, 2006, 16 (3), pp.443-460. ⟨hal-00619735⟩
  • Marie-Pierre Béal, Dominique Perrin. Codes, unambiguous automata and sofic systems. Theoretical Computer Science, Elsevier, 2006, 356 (1-2), pp.6-13. ⟨hal-00619226⟩
  • Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin. A hierarchy of shift equivalent sofic shifts. Theoretical Computer Science, Elsevier, 2005, 345 (2-3), pp.390-205. ⟨hal-00619229⟩
  • Maxime Crochemore, Jacques Désarménien, Dominique Perrin. A note on the Burrows-Wheeler transformation. Theoretical Computer Science, Elsevier, 2005, 332 (1-3), pp.567-572. ⟨10.1016/j.tcs.2004.11.014⟩. ⟨hal-00004249⟩
  • Marie-Pierre Béal, Dominique Perrin. Codes and sofic constraints. Theoretical Computer Science, Elsevier, 2005, 340 (2), pp.381-393. ⟨hal-00619227⟩
  • Jean-Marc Champarnaud, Georges Hansel, Dominique Perrin. Unavoidable sets of constant length. International Journal of Algebra and Computation, World Scientific Publishing, 2004, 14 (1), pp.241-251. ⟨10.1142/S0218196704001700⟩. ⟨hal-00619542⟩
  • Marie-Pierre Béal, Dominique Perrin. On the generating sequences of regular languages on k-symbols. J. of the Association for Computing Machinery, 2003, 50 (6), pp.955-980. ⟨10.1145/950620.950625⟩. ⟨hal-00619228⟩
  • Guo-Niu Han, Dominique Perrin. Ensembles inévitables. Seminaire Lotharingien de Combinatoire, Université Louis Pasteur, 2002, 47 (B47e), pp.16. ⟨https://emis.u-strasbg.fr/journals/SLC/wpapers/s47hanperr.html⟩. ⟨hal-00321348⟩
  • Marie-Pierre Béal, Dominique Perrin. A weak equivalence between shifts of finite type. Advances in Applied Mathematics, Elsevier, 2002, 29 (2), pp.162-171. ⟨hal-00619322⟩
  • Dominique Perrin. Les automates finis. Technique et Science Informatiques, Hermès-Lavoisier, 2000, 19 (3), pp.395-402. ⟨hal-00793910⟩
  • Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin. A finite state version of the Kraft-McMillan theorem. SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2000, 30 (4), pp.1211-1230. ⟨hal-00619334⟩
  • Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin. Enumerative sequences of leaves and nodes in rational trees. Theoretical Computer Science, Elsevier, 1999, 221 (1-2), pp.41-60. ⟨hal-00619336⟩
  • Dominique Perrin. Les débuts de la théorie des automates. Technique et Science Informatiques, Hermès-Lavoisier, 1995, 14 (4), pp.409-433. ⟨hal-00793909⟩
  • Joelle Cohen, Dominique Perrin, Jean-Eric Pin. On the expressive power of temporal logic for finite words. Journal of Computer and System Sciences (JCSS), Elsevier, 1993, 46, pp.271-294. ⟨hal-00020069⟩
  • Maxime Crochemore, Dominique Perrin. Two-way string-matching. J. Assoc. Comput. Mach., 1991, 38 (3), pp.651-675. ⟨hal-00619582⟩
  • Maxime Crochemore, Dominique Perrin. Critical factorizations of words. Bulletin- European Association for Theoretical Computer Science, European Association for Theoretical Computer Science; 1999, 1988, 34 (1), pp.47-52. ⟨hal-00619591⟩
  • Marie-Pierre Béal, Dominique Perrin. Une caractérisation des ensembles sofiques. C. R. Acad. Sci. Paris Sér. I Math., 1986, 303 (6), pp.255-257. ⟨hal-00619328⟩
  • Jean Berstel, Dominique Perrin. Trends in the theory of codes. Bulletin- European Association for Theoretical Computer Science, European Association for Theoretical Computer Science; 1999, 1986, 29 (1), pp.84-95. ⟨hal-00619484⟩

Conference papers16 documents

  • Dominique Perrin. Codes and automata in minimal sets. WORDS 2015, Sep 2015, Kiel, Germany. pp.35-46, ⟨10.1007/978-3-319-23660-5_4⟩. ⟨hal-01855957⟩
  • Eugene Asarin, Nicolas Basset, Marie-Pierre Béal, Aldric Degorre, Dominique Perrin. Toward a timed theory of channel coding. FORMATS, 2012, United Kingdom. pp.27-42, ⟨10.1007/978-3-642-33365-1_4⟩. ⟨hal-00793143⟩
  • Eugene Asarin, Nicolas Basset, Aldric Degorre, Dominique Perrin. Generating functions of timed languages. MFCS 2012, Aug 2012, Bratislava, Slovakia. pp.124-135, ⟨10.1007/978-3-642-32589-2_14⟩. ⟨hal-00678443v2⟩
  • Marie-Pierre Béal, Dominique Perrin. A quadratic upper bound on the size of a synchronizing word in one-cluster automata. 13th International Conference on Developments in Language Theory (DLT 2009), Jun 2009, Stuttgart, Germany. pp.81-90, ⟨10.1007/978-3-642-02737-6_6⟩. ⟨hal-00620310⟩
  • Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin. Embeddings of local automata. IEEE International Symposium on Information Theory (ISIT'08), Jul 2008, United States. pp.2351-2355. ⟨hal-00620271⟩
  • Dominique Perrin. Variants of the road coloring problem. Journées Montoises d'Informatique Théorique, 2008, France. ⟨hal-00620455⟩
  • Dominique Perrin. Road Coloring. London Stringology Days and Algorithmic Workshop, 2008, France. ⟨hal-00620456⟩
  • Dominique Perrin. Embeddings of automata. AutoMathA, 2007, France. ⟨hal-00620457⟩
  • Dominique Perrin. Theory and practice: the applications of combinatorics on words. STIC-AMSUD, Oct 2006, France. ⟨hal-00620454⟩
  • Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin. A hierarchy of irreducible sofic shifts. 29th International Symposium on Mathematical Foundations of Computer Science 2004, 2004, Czech Republic. pp.611-622. ⟨hal-00619854⟩
  • Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin. The syntactic graph of a sofic shift. 21st International Symposium on Theoretical Aspects of Computer Science (STACS 2004), Mar 2004, Montpellier, France. pp.282-293. ⟨hal-00619853⟩
  • Marie-Pierre Béal, Dominique Perrin. Complete codes in a sofic shift. 19th International Symposium on Theoretical Aspects of Computer Science (STACS 2002), 2002, France. pp.547-558. ⟨hal-00619856⟩
  • Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin. Length distributions and regular sequences. Codes, systems, and graphical models (Minneapolis, MN, 1999), 2001, United States. pp.415-437. ⟨hal-00619863⟩
  • Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin. Super-state automata and rational trees. 3rd Latin American Theoretical INformatics (LATIN'98), Apr 1998, Campinas, Brazil. pp.42-52. ⟨hal-00619862⟩
  • Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin. Enumerative sequences of leaves in rational trees. International Colloquium on Automata, Languages and Programming (ICALP 1997), 1997, Italy. pp.76-86. ⟨hal-00619864⟩
  • Maxime Crochemore, Dominique Perrin. Pattern matching in strings. Proceedings of the 4th conference on Image Analysis and Processing (Cefalù, 1988), 1988, France. pp.67-79. ⟨hal-00619999⟩

Books4 documents

  • Jean Berstel, Dominique Perrin, Christophe Reutenauer. Codes and Automata. Cambridge University Press, 129, 619pp., 2009, Encyclopedia of Mathematics and its Applications. ⟨hal-00620616⟩
  • Jean-Eric Pin, Dominique Perrin. Infinite Words: Automata, Semigroups, Logic and Games. Elsevier, pp.538, 2004. ⟨hal-00112831⟩
  • Dominique Perrin, Jean-Eric Pin. Infinite Words, Automata, Semigroups, Logic and Games. Elsevier, 141, 550pp., 2004. ⟨hal-00619830⟩
  • Jean Berstel, Dominique Perrin. Theory of codes. Academic Press Inc., 117, pp.xiv+433, 1985, Pure and Applied Mathematics. ⟨hal-00619780⟩

Book sections10 documents

  • Dominique Perrin, Antonio Restivo. Enumerative combinatorics on words. Miklos Bona. Handbook of Enumerative Combinatorics, CRC Press, 2015, 9781482220858. ⟨http://www.crcpress.com/product/isbn/9781482220858⟩. ⟨hal-01121901⟩
  • Francesco Dolce, Dominique Perrin. Enumeration Formulæ in Neutral Sets. Developments in Language Theory, 2015, ⟨10.1007/978-3-319-21500-6_17⟩. ⟨hal-01367707⟩
  • Valérie Berthé, Clelia de Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, et al.. Specular Sets. Combinatorics on Words, 2015, ⟨10.1007/978-3-319-23660-5_18⟩. ⟨hal-01367700⟩
  • Marie-Pierre Béal, Jean Berstel, Brian H. Marcus, Dominique Perrin, Christophe Reutenauer, et al.. Variable-length codes and finite automata. I. 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. ⟨hal-00620817⟩
  • Olivier Carton, Dominique Perrin, Jean-Eric Pin. Automata and semigroups recognizing infinite words. J. Flum, E. Grädel and T. Wilke. Logic and Automata, History and perspectives, Amsterdam University Press, pp.585-596, 2007. ⟨hal-00340797⟩
  • Dominique Perrin. Automi e linguaggi formali. Petruccioli Sandro. Storia della Scienza, IX, Istituto della Enciclopedia Italiana, pp.197-205, 2003. ⟨hal-00620806⟩
  • Jean Berstel, Dominique Perrin. Finite and infinite words. Lothaire M. Algebraic Combinatorics on Words, Cambridge University Press, pp.1-39, 2002. ⟨hal-00620767⟩
  • Dominique Perrin. Enumerative combinatorics on words. Crapo Henri, Rota Gian-Carlo. Algebraic Combinatorics and Computer Science, Springer-Verlag, pp.391-430, 2001. ⟨hal-00620805⟩
  • Marie-Pierre Béal, Dominique Perrin. Chapter 10: Symbolic dynamics and finite automata. Rosenberg G., Salomaa A. Handbook of formal languages, 2, Springer-Verlag, pp.463-505, 1997. ⟨hal-00620643⟩
  • Maxime Crochemore, Dominique Perrin, Jean-Eric Pin. Les automates finis. ?. Le Courrier du C.N.R.S., la recherche en informatique, C.N.R.S., pp.48-51, 1993. ⟨hal-00620850⟩

Directions of work or proceedings1 document

  • Jean Berstel, Dominique Perrin. Applied Combinatorics on Words. 105, Cambridge University Press, 610pp., 2005, Encyclopedia of Mathematics and its Applications. ⟨hal-00620613⟩

Other publications1 document

  • Marie-Pierre Béal, Eugen Czeizler, Jarkko Kari, Dominique Perrin. On the synchronization delay of local automata. 2007. ⟨hal-00620452⟩

Preprints, Working Papers, ...2 documents

  • Revekka Kyriakoglou, Dominique Perrin. Profinite semigroups. 2017. ⟨hal-01947235⟩
  • Francesco Dolce, Dominique Perrin. Interval exchanges, admissibility and branching Rauzy induction. 2016. ⟨hal-01367715⟩

Reports1 document

  • Marie-Pierre Béal, Sylvain Lombardy, Dominique Perrin. Embeddings of automata. 2007. ⟨hal-00627816⟩