Publications de Jean-Eric Pin

  1. J.-E. Pin, Holoïdes factoriels, Studia Scientarum Mathematicarum Hungarica 12 (1977), 169-184. Abstract

  2. J.-E. Pin, Sur la longueur des mots de rang donné d'un automate fini, Comptes rendus de l'Académie des Sciences 284 (1977), 1233-1235. Abstract, PostScript gzipped file, PDF file

  3. D. Perrin and J.-E. Pin, Théorie de l'information et théorie du codage, in Actes du séminaire d'informatique théorique, Paris, (1977-1978), 15-22.

  4. J.-E. Pin, Le problème de la synchronisation et la conjecture de Cerný, Thèse de 3ème cycle, Université Paris VI, (1978). Abstract

  5. J.-E. Pin, Sur le monoïde de L* lorsque L est un langage fini, Theoretical Computer Science 7 (1978), 211-215. Abstract

  6. J.-E. Pin, Sur les mots synchronisants dans un automate fini, Elektron. Informationsverarb. Kybernet. 14 (1978), 293-303. Abstract

  7. J.-E. Pin, Sur un cas particulier de la conjecture de Cerný, in 5th ICALP, Berlin, (1978), 345-352, Lecture Notes in Computer Science 62, Springer. Abstract, PostScript gzipped file, PDF file

  8. J.-E. Pin, Utilisation de l'algèbre linéaire en théorie des automates, in Actes du 1er Colloque AFCET-SMF de Mathématiques Appliquées, 85-92, AFCET, (1978). Abstract, PostScript gzipped file, PDF file

  9. J.-F. Perrot and J.-E. Pin, Finite syntactic monoids, in Fundamentals of Computation Theory (Proc. Conf. Algebraic, Arith. and Categorical Methods in Comput. Theory, Berlin/Wendisch-Rietz), L. Budach (éd.), 544-558, Akademie-Verlag, (1979).

  10. J.-E. Pin, Morphismes relationnels entre semigroupes, in Actes du colloque Codages et Transductions, Florence, (1979), 254-272, CNR.

  11. J.-E. Pin, Une caractérisation de trois variétés de langages bien connues, in 4th GI Conference, Berlin, (1979), 233-243, Lecture Notes in Computer Science 67, Springer. Abstract

  12. J.-E. Pin, Variétés et codes, in Actes de la 7ème école de printemps d'informatique théorique, (1979), 185-207.

  13. J.-E. Pin, Propriétés syntactiques du produit non ambigu, in 7th ICALP, Berlin, (1980), 483-499, Lecture Notes in Computer Science 85, Springer. Abstract

  14. J.-E. Pin, Langages reconnaissables et codage préfixe pur, in 8th ICALP, Berlin, (1981), 184-192, Lecture Notes in Computer Science 115, Springer.

  15. J.-E. Pin, Le problème de la synchronisation et la conjecture de Cerný, in Non-commutative structures in algebra and geometric combinatorics, A. De Luca (éd.), 37-48, Quaderni de la Ricerca Scientifica vol. 109, CNR, Roma, (1981). Abstract, PostScript gzipped file, PDF file

  16. J.-E. Pin, Un analogue du théorème des variétés pour les cônes et les cylindres, in 5th GI Conference, Berlin, (1981), 78-90, Lecture Notes in Computer Science 104, Springer.

  17. J.-E. Pin, Variétés de langages et variétés de semigroupes, Thèse d'état, Université Paris VI, (1981).

  18. J.-E. Pin and H. Straubing, Monoids of upper triangular boolean matrices, in Colloquia Mathematica Societatis Janos Bolyal, 259-272, (1981). Abstract, PostScript gzipped file, PDF file.

  19. J.-E. Pin and H. Straubing, Remarques sur le dénombrement des variétés de monoïdes finis, Comptes rendus de l'Académie des Sciences 292 (1981), 111-113.

  20. J.-E. Pin, On varieties of rational languages and variable-length codes, Journal of Pure and Applied Algebra 23 (1982), 169-196.

  21. J.-E. Pin, Van der Waerden's theorem, in Combinatorics on words, M. Lothaire (éd.), ch. 3, Encyclopedia of Mathematics vol. 17, Addison-Wesley, New-York and Cambridge University Press, (1982).

  22. J.-E. Pin and I. Simon, A note on the triangle conjecture, Journal of Combinatorial Theory series A 32 (1982), 106-109.

  23. J.-E. Pin, Arbres et hiérarchies de concaténation, in 10th ICALP, Berlin, (1983), 617-628, Lecture Notes in Computer Science 154, Springer.

  24. J.-E. Pin, Concatenation hierarchies, decidability results and problems, in Combinatorics on words, progress and perspectives, L. Cummings (éd.), Berlin, (1983), 195-228, Academic Press.

  25. J.-E. Pin, Introduction aux langages reconnaissables. Journées d'Avignon d'Informatique Théorique, (1983).

  26. J.-E. Pin, On two combinatorial problems arising from automata theory, Annals of Discrete Mathematics 17 (1983), 535-548. Abstract, PostScript gzipped file, PDF file

  27. J.-E. Pin and J. Sakarovitch, Some operations and transductions that preserve rationality, in 6th GI Conference, Berlin, (1983), 277-288, Lecture Notes in Computer Science 145, Springer. Abstract, PostScript gzipped file, PDF file

  28. S. Margolis and J.-E. Pin, An extension of the structure theory of inverse semigroups to the non-regular case, in Theory of Semigroups, Greifswald, (1984), 82-91. Abstract

  29. S. Margolis and J.-E. Pin, Graphs, inverse semigroups and languages, in Proceedings of the Marquette Semigroup Conference, (1984), 85-112.

  30. S. Margolis and J.-E. Pin, Languages and inverse semigroups, in 11th ICALP, Berlin, (1984), 337-346, Lecture Notes in Computer Science 172, Springer.

  31. S. Margolis and J.-E. Pin, Minimal noncommutative varieties of finite monoids, Pacific Journal of Math 111 (1984), 125-135.

  32. S. Margolis and J.-E. Pin, Power monoids and finite J-trivial monoids, Semigroup Forum 29 (1984), 99-108.

  33. S. Margolis and J.-E. Pin, Varieties of finite monoids and topology for the free monoid, in Proceedings of the Marquette Semigroup Conference, (1984), 113-130.

  34. J.-E. Pin, Hiérarchies de concaténation, RAIRO Informatique Théorique 18, (1984), 23-46. Abstract, PostScript gzipped file, PDF file

  35. J.-E. Pin, On semidirect products of two finite semilattices, Semigroup Forum 28 (1984), 73-81.

  36. J.-E. Pin, Semigroupe des parties et relations de Green, Canadian Journal of Math 36 (1984), 327-343.

  37. J.-E. Pin, Star-free-languages and first-order logic, in Automata on infinite words, Berlin, (1984), 56-57, Lecture Notes in Computer Science 192, Springer.

  38. J.-E. Pin, Variétés de langages formels, Masson, Paris, (1984).

  39. J.-E. Pin, H. Straubing and D. Thérien, Small varieties of finite semigroups and extensions, J. Austral. Math. Soc. 37 (1984), 269-281.

  40. S. Margolis and J.-E. Pin, Products of group languages, in FCT, Berlin, (1985), 285-299, Lecture Notes in Computer Science 199, Springer. Abstract, PostScript gzipped file, PDF file

  41. J.-E. Pin, Finite group topology and p-adic topology for free monoids, in 12th ICALP, Berlin, (1985), 445-455, Lecture Notes in Computer Science 194, Springer.

  42. J.-E. Pin and J. Sakarovitch, Une application de la représentation matricielle des transductions, Theoretical Computer Science 35 (1985), 271-293.

  43. S. Margolis and J.-E. Pin, On varieties of rational languages and variable-length code II, J. of Pure and Applied Algebra 41 (1986), 233-253.

  44. D. Perrin and J.-E. Pin, First order logic and star-free sets, Journal of Computer and System Sciences 32 (1986), 393-406.

  45. J.-E. Pin, Power semigroups and related varieties of finite semigroups, in Semigroups and Their Applications, S. Goberstein and P. Higgins (éd.), 139-152, D. Reidel, (1986).

  46. J.-E. Pin, Varieties of formal languages, North Oxford, London and Plenum, New-York, (1986). (Traduction de Variétés de langages formels).

  47. S. Margolis and J.-E. Pin, Expansions, free inverse semigroups and Schützenberger product, Journal of Algebra 110 (1987), 298-305. Abstract

  48. S. Margolis and J.-E. Pin, Inverse semigroups and extensions of groups by semilattices, Journal of Algebra 110 (1987), 277-297.

  49. S. Margolis and J.-E. Pin, Inverse semigroups and varieties of finite semigroups, Journal of Algebra 110 (1987), 306-323.

  50. J.-E. Pin, On the languages accepted by finite reversible automata, in 14th ICALP, Berlin, (1987), 237-249, Lecture Notes in Computer Science 267, Springer Verlag. Abstract, PostScript gzipped file, PDF file

  51. J.-E. Pin, A property of the Schützenberger product, Semigroup Forum 35 (1987), 53-62.

  52. J.-E. Pin, A topological approach to a conjecture of Rhodes, Bulletin of the Australian Mathematical Society 38 (1988), 421-431. Abstract

  53. J.-E. Pin, H. Straubing and D. Thérien, Locally trivial categories and unambiguous concatenation, Journal of Pure and Applied Algebra 52 (1988), 297-311. Abstract

  54. D. Beauquier and J.-E. Pin, Factors of words, in 16th ICALP, Berlin, (1989), 63-79, Lecture Notes in Computer Science 372, Springer Verlag.

  55. J. Berstel, M. Crochemore and J.-E. Pin, Thue sequence and p-adic topology of the free monoid, Discrete Mathematics 76 (1989), 89-94. Abstract, PostScript gzipped file, PDF file

  56. J.-M. Champarnaud and J.-E. Pin, A maxmin problem on finite automata, Discrete Applied Mathematics 23 (1989), 91-96. Abstract, PostScript gzipped file, PDF file

  57. J.-E. Pin, On a conjecture of Rhodes, Semigroup Forum 39 (1989), 1-15. Abstract

  58. J.-E. Pin, Relational morphisms, transductions and operations on languages, in Formal Properties of Finite Automata and Applications, Berlin, (1989), 34-55, Lecture Notes in Computer Science 386, Springer Verlag. Abstract, PostScript gzipped file, PDF file

  59. J.-E. Pin, H. Straubing and D. Thérien, New results on the generalized star-height problem, in STACS 89, Berlin, (1989), 458-467, Lecture Notes in Computer Science 349, Springer Verlag.

  60. C. Ash, T. Hall and J.-E. Pin, On the varieties of languages associated to some varieties of finite monoids with commuting idempotents, Information and Computation 86 (1990), 32-42. Abstract, PostScript gzipped file, PDF file

  61. J.-E. Pin, Rational and recognizable langages, in Lectures in applied mathematics and informatics, Ricciardi (éd.), 62-106, Manchester University Press, (1990).

  62. D. Beauquier and J.-E. Pin, Languages and scanners, Theoretical Computer Science 84 (1991), 3-21. Abstract, PostScript gzipped file, PDF file

  63. J. Berstel, J.-E. Pin et M. Pocchiola, Mathématiques et informatique : exercices résolus, vol. 1, McGraw-Hill France, (1991).

  64. J. Berstel, J.-E. Pin et M. Pocchiola, Mathématiques et informatique : exercices résolus, vol. 2, McGraw-Hill France, (1991).

  65. K. Henckell, S. Margolis, J.-E. Pin and J. Rhodes, Ash's type II theorem, profinite topology and Malcev products, International Journal of Algebra and Computation 1 (1991), 411-436. Abstract, PostScript gzipped file, PDF file

  66. B. Le Saec, J.-E. Pin and P. Weil, A purely algebraic proof of McNaughton's theorem on infinite words, in Foundations of Software Technology and Theoretical Computer Science, S. Biswas and K. Nori (éd.), 141-151, Lecture Notes in Computer Science 560, Springer, (1991). Abstract

  67. B. Le Saec, J.-E. Pin and P. Weil, Semigroups whith idempotent stabilizers and applications to automata theory, International Journal of Algebra and Computation 1 (1991), 291-314. Abstract, PostScript gzipped file, PDF file

  68. J.-E. Pin, Topologies for the free monoid, Journal of Algebra 137 (1991), 297-337. Abstract

  69. J.-E. Pin and C. Reutenauer, A conjecture on the Hall topology for the free group, Bull. London Math. Soc. 23 (1991), 356-362. Abstract, PostScript gzipped file, PDF file

  70. J. Almeida, J.-E. Pin and P. Weil, Semigroups whose idempotents form a subsemigroup, Math. Proc. Cambridge Phil. Soc. 111 (1992), 241-253. Abstract, PostScript gzipped file, PDF file

  71. J.-P. Arcangeli, M. Crochemore, J.-N. Hourcastagnou and J.-E. Pin, Compression for an effective management of telemetry data, in SPACEOPS'92 Conference Proceedings, 823-830, (1992). Abstract

  72. S. W. Margolis and J.-E. Pin, New results on the conjecture of Rhodes and on the topological conjecture, Journal of Pure and Applied Algebra 80 (1992), 305-313. Abstract

  73. J.-E. Pin, On reversible automata, in Proceedings of the first LATIN conference, Saõ-Paulo, (1992), 401-416, Lecture Notes in Computer Science 583, Springer. Abstract, PostScript gzipped file, PDF file

  74. J.-E. Pin, H. Straubing and D. Thérien, Some results on the generalized star-height problem, Information and Computation 101 (1992), 219-250. Abstract, PostScript gzipped file, PDF file

  75. C. Antoine, B. Le Goff and J.-E. Pin, A graphic language based on timing diagrams, in Foundations of Software Technology and Theoretical Computer Science, R. K. Shyamasundar (éd.), 306-316, Lecture Notes in Computer Science 761, Springer Verlag, (1993). Abstract, PostScript gzipped file, PDF file

  76. J. Cohen, D. Perrin and J.-E. Pin, On the expressive power of temporal logic for finite words, Journal of Computer and System Sciences 46 (1993), 271-294. Abstract, PostScript gzipped file, PDF file

  77. J.-E. Pin, Topologie p-adique sur les mots, Journal de théorie des nombres de Bordeaux 5 (1993), 263-281. Abstract, PostScript gzipped file, PDF file

  78. J.-E. Pin and D. Thérien, The bideterministic concatenation product, International Journal of Algebra and Computation 3 (1993), 535-555. Abstract, PostScript gzipped file, PDF file

  79. J.-E. Pin, Logic On Words, Bulletin of the European Association of Theoretical Computer Science 54 (1994), 145-165.
    Current Trends in Theoretical Computer Science, Entering the 21st Century, eds. G. Paun, G. Rozenberg and A. Salomaa, Word Scientific, (2001), 254-273. Abstract, PostScript gzipped file, PDF file

  80. J.-E. Pin, Polynomial closure of group languages and open sets of the Hall topology, in 21th ICALP, Berlin, (1994), 424-435, Lecture Notes in Computer Science 820, Springer Verlag. Abstract, PostScript gzipped file, PDF file

  81. I. Guessarian and J.-E. Pin, Linearizing some recursive logic programs, IEEE Transactions on Knowledge and Data Engineering 7 (1995), 137-149. Abstract, PostScript gzipped file, PDF file

  82. D. Perrin and J.-E. Pin, Semigroups and automata on infinite words, in NATO Advanced Study Institute Semigroups, Formal Languages and Groups, J. Fountain (éd.), 49-72, Kluwer academic publishers, (1995). Abstract, PostScript gzipped file, PDF file

  83. J.-E. Pin, Finite semigroups and recognizable languages : an introduction, in NATO Advanced Study Institute Semigroups, Formal Languages and Groups, J. Fountain (éd.), 1-32, Kluwer academic publishers, (1995). Abstract, PostScript gzipped file, PDF file

  84. J.-E. Pin, A negative answer to a question of Wilke on varieties of omega-languages, Information Processing Letters 56, (1995), 197-200. Abstract, PostScript gzipped file, PDF file

  85. J.-E. Pin, PG = BG, a success story, in NATO Advanced Study Institute Semigroups, Formal Languages and Groups, J. Fountain (éd.), 33-47, Kluwer academic publishers, (1995). Abstract, PostScript gzipped file, PDF file

  86. J.-E. Pin, A variety theorem without complementation, Russian Mathematics (Izvestija vuzov.Matematika) 39 (1995), 80-90. Abstract, PostScript gzipped file, PDF file

  87. J.-E. Pin and P. Weil, Polynomial closure and unambiguous product, in 22th ICALP, Berlin, (1995), 348-359, Lecture Notes in Computer Science 944, Springer Verlag. Abstract, PostScript gzipped file, PDF file

  88. C. Antoine, B. Le Goff and J.-E. Pin, A graphic language based on timing diagrams, Sadhana, Journal of Engineering Sciences of the Indian Academy of Sciences 21 (1996), 125-145. Abstract, PostScript gzipped file, PDF file

  89. J. Berstel and J.-E. Pin, Local languages and the Berry-Sethi algorithm, Theoretical Computer Science 155, (1996), 439-446. Abstract, PostScript gzipped file, PDF file

  90. J.-E. Pin, The expressive power of first order sentences of Büchi's sequential calculus, in 23th ICALP, Berlin, (1996), 300-311, Lecture Notes in Computer Science 1099, Springer Verlag. Abstract, PostScript gzipped file, PDF file

  91. J.-E. Pin, Finite semigroups as categories, ordered semigroups or compact semigroups, Semigroup Theory and its Applications, K. H. Hofmann and M. W. Mislove ed., Cambridge University Press, London Mathematical Society Lecture Note Series 231, (1996), 107-121. Abstract, PostScript gzipped file, PDF file

  92. J.-E. Pin, Logic, Semigroups and Automata on Words, Annals of Mathematics and Artificial Intelligence 16 (1996), 343-384. Abstract, PostScript gzipped file, PDF file

  93. J.-E. Pin, Polynomial closure of group languages and open sets of the Hall topology, Theoretical Computer Science 169, (1996), 185-200. Version complète de [80]. Abstract, PostScript gzipped file, PDF file

  94. J.-E. Pin and P. Weil, Profinite semigroups, Mal'cev products and identities, J. of Algebra 182 (1996), 604-626. Abstract, PostScript gzipped file, PDF file

  95. J.-E. Pin and P. Weil, A Reiterman theorem for pseudovarieties of finite first-order structures, Algebra Universalis 35 (1996), 577-595. Abstract, PostScript gzipped file, PDF file

  96. V. Froidure and J.-E. Pin, Algorithms for computing finite semigroups, in Foundations of Computational Mathematics, F. Cucker and M. Shub eds., Berlin, Springer Verlag, (1997), 112-126. Abstract, PostScript gzipped file, PDF file

  97. J.-E. Pin, Syntactic semigroups, Chap. 10 in Handbook of language theory, Vol. I, G. Rozenberg and A. Salomaa (éd.), Springer Verlag, (1997), 679-746. Abstract, PostScript gzipped file, PDF file

  98. J.-E. Pin and P. Weil, Polynomial closure and unambiguous product, Theory Comput. Systems 30, (1997), 383-422. Abstract, PostScript gzipped file, PDF file

  99. J.-E. Pin, Tropical Semirings, in Idempotency, J. Gunawardena (éd.), Cambridge University Press, (1998), 50-69. Abstract, PostScript gzipped file, PDF file

  100. J.-E. Pin, Positive varieties and infinite words, in LATIN 98, Berlin, Lecture Notes in Computer Science 1380, (1998), 76-87, Springer Verlag. Abstract, PostScript gzipped file, PDF file

  101. J.-E. Pin, Bridges for concatenation hierarchies, in 25th ICALP, Berlin, Lecture Notes in Computer Science 1443, Springer Verlag, (1998), 431-442. Abstract, PostScript gzipped file, PDF file

  102. J.-E. Pin and P. Weil, Uniformities on free semigroups, International Journal of Algebra and Computation, 9, (1999), 431-453. Abstract, PostScript gzipped file, PDF file

  103. K. Henckell and J.-E. Pin, Ordered monoids and J-trivial monoids, Algorithmic problems in Groups and Semigroups, J.-C. Birget, S. Margolis, J. Meakin and M. Sapir eds., Birkhäuser, Trends in Mathematics, Boston, (2000), 121-137. Abstract, PostScript gzipped file, PDF file

  104. J.-E. Pin and P. Weil, A conjecture on the concatenation product, Theoret. Informatics Appl. 35, (2001), 597-618. Abstract, PostScript gzipped file, PDF file

  105. J.-E. Pin and P. Weil, Semidirect products of ordered semigroups, Communications in Algebra 30, (2002), 149-169. Abstract, PostScript gzipped file, PDF file

  106. J.-E. Pin, A. Pinguet and P. Weil, Ordered categories and ordered semigroups, Communications in Algebra 30, (2002), 5651-5675. Abstract, PostScript gzipped file, PDF file

  107. J.-E. Pin and P. Weil, The wreath product principle for ordered semigroups, Communications in Algebra 30, (2002), 5677-5713 Abstract, PostScript gzipped file, PDF file

  108. J.-E. Pin, Algebraic tools for the concatenation product, Theoretical Computer Science 292, (2003), 317-342. Abstract, PostScript gzipped file, PDF file

  109. S.W. Margolis, J.-E. Pin and M.V. Volkov, Words guaranteeing minimal image, Proceedings of the Third International Colloquium on Words, Languages and Combinatorics, Masami Ito and Teruo Imaoka eds, World Scientific, (2003), 297-310. Abstract, PostScript gzipped file, PDF file

  110. A. Cano Gómez and J.-E. Pin, On a conjecture of Schnoebelen, in DLT 2003, Zoltán Ésik, Zoltán Fülöp eds., Berlin, Lecture Notes in Computer Science, 2710 Springer Verlag, (2003), 35-54. Abstract, PostScript gzipped file, PDF file

  111. J. Berstel, L. Boasson, O. Carton, B. Petazzoni and J.-E. Pin, Operations preserving recognizable languages, in FCT'2003, Andrzej Lingas and Bengt J. Nilsson eds., Berlin, Lecture Notes in Computer Science, 2751, Springer Verlag, (2003), 343-354. Abstract, PostScript gzipped file, PDF file

  112. J. Fountain, J.-E. Pin and P. Weil, Covers for monoids, J. of Algebra 271, (2004), 529-586. Abstract, PostScript gzipped file, PDF file

  113. A. Cano Gómez and J.-E. Pin, Shuffle on positive varieties of languages, Theoretical Computer Science 312, (2004), 433-461. Abstract, PostScript gzipped file, PDF file

  114. S.W. Margolis, J.-E. Pin and M.V. Volkov, Words guaranteeing minimal image, International Journal of Foundations of Computer Science 15, (2004), 259-276. Abstract, PostScript gzipped file, PDF file

  115. D. Perrin and J.-E. Pin, Infinite Words, Pure and Applied Mathematics Vol 141, Elsevier, (2004), ISBN 0-12-532111-2. Abstract

  116. J.-E. Pin, The expressive power of existential first order sentences of Büchi's sequential calculus, (extended version of the ICALP 96 paper) Discrete Mathematics 291 (2005) 155-174. Abstract, PostScript gzipped file, PDF file

  117. J.-E. Pin and H. Straubing, Some results on C-varieties, Theoret. Informatics Appl. 39 (2005) 239-262. Abstract, PostScript gzipped file, PDF file

  118. J.-E. Pin and P. Silva, A topological approach to transductions, Theoretical Computer Science 340 (2005) 443-456. Abstract, PostScript gzipped file, PDF file

  119. G. Gomes, J.-E. Pin, and H. Sezinando, Presentations of the Schützenberger product of n groups, Communications in Algebra 34 (2006) 1213--1235. Abstract, PostScript gzipped file, PDF file

  120. J. Berstel, L. Boasson, O. Carton, B. Petazzoni and J.-E. Pin, Operations preserving recognizable languages, (Full version), Theoretical Computer Science 354 (2006), 405-420. Abstract, PostScript gzipped file, PDF file

  121. L. Chaubard and J.-E. Pin, Open problems on regular languages: an historical perspective, in Semigroups and formal languages, Proceedings of the International Conference Centro de Algebra da Universidade de Lisboa (CAUL), Portugal, 12-15 July 2005, J. André, V. Fernandes, M. J. Branco, G. Gomes, J. Fountain and J. Meakin (ed.) (2007), 39-56, Word Scientific. Abstract, PostScript gzipped file, PDF file

  122. L. Chaubard, J.-E. Pin, and H. Straubing, Actions, Wreath Products of C-varieties and Concatenation Product, Theoretical Computer Science 356 (2006), 73-89. Abstract, PostScript gzipped file, PDF file

  123. M. Golovkins and J.-E. Pin, Varieties generated by certain models of reversible finite automata, COCOON 2006, Lecture Notes in Computer Science 4112 (2006), 83-93. Abstract, PostScript gzipped file, PDF file

  124. L. Chaubard, J.-E. Pin, and H. Straubing, First order formulas with modular predicates, 21st Annual IEEE Symposium on Logic in Computer Science, LICS 2006, IEEE, 211-220. Abstract, PostScript gzipped file, PDF file

  125. J.-E. Pin, Algorithmique et Programmation. Introduction, Encyclopédie de l'informatique et des systèmes d'information, sous la direction de J. Akoka et I. Comyn-Wattiau, Vuibert 2006, Chap. I/9 913-918. Abstract, PostScript gzipped file, PDF file

  126. J.-E. Pin, Algorithmique et Programmation. Automates finis, Encyclopédie de l'informatique et des systèmes d'information, sous la direction de J. Akoka et I. Comyn-Wattiau, Vuibert 2006, Chap. I/9 966-976. Abstract, PostScript gzipped file, PDF file

  127. J.-E. Pin, Automates réversibles: combinatoire, algèbre et topologie, Leçons de mathématiques d'aujourd'hui, édité par E. Charpentier, à paraitre chez Cassini, Abstract, PostScript gzipped file, PDF file

  128. J.-E. Pin and P.V. Silva, A Mahler's theorem for functions from words to integers, 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008), Susanne Albers and Pascal Weil, eds. Internationales Begegnungs- Und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Dagstuhl, Germany, 2008, 585-596. Abstract, PostScript gzipped file, PDF file

  129. O. Carton, D. Perrin, J.-E. Pin, Automata and semigroups recognizing infinite words. Logic and Automata, History and perspectives, J. Flum, E. Grädel and T. Wilke, eds, Amsterdam University Press, 2007, 133-167. Abstract, PostScript gzipped file, PDF file

  130. M. Gehrke, S. Grigorieff, J.-E. Pin, Duality and equational theory of regular languages, Best paper award, Track B, ICALP 2008, Part II, Lecture Notes in Computer Science 5126, Springer Verlag, (2008), 246--257. Abstract, PostScript gzipped file, PDF file

  131. A. Cano Gómez, G. Guaiana, J.-E. Pin, When does partial commutative closure preserve regularity?, ICALP 2008, Part II, Lecture Notes in Computer Science 5126, Springer Verlag, (2008), 209-220. Abstract, PostScript gzipped file, PDF file

  132. A. Cano Gómez and J.-E. Pin, A robust class of regular languages, MFCS 2008, Lecture Notes in Computer Science 5162, Springer Verlag, (2008), 36-51. Abstract, PostScript gzipped file, PDF file

  133. J.-E. Pin, Profinite methods in automata theory, 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), Susanne Albers and Jean-Yves Marion, eds. Internationales Begegnungs- Und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Dagstuhl, Germany, 2009, 31-50. Abstract, PostScript gzipped file, PDF file

  134. O. Carton, J.-E. Pin, X. Soler-Escrivà, Languages recognized by finite supersoluble groups, Journal of Automata, Languages and Combinatorics, 14, (2009), 149-161. Abstract, PostScript gzipped file, PDF file

  135. M. J. J. Branco and J.-E. Pin, Equations defining the polynomial closure of a lattice of regular languages, ICALP 2009, Part II, Lecture Notes in Computer Science 5556, Springer Verlag, (2009), 115-126. Abstract, PostScript gzipped file, PDF file


Dernière modification 06/10/2009

Valid HTML 4.01!