Publications de Jean-Éric Pin

The icon 0 links to HAL, an open access archive. The icon 0 links to a PDF file.


    2019

  1. J.É Pin and X. Soler-Escrivà, Languages and formations generated by \(D_4\) and \(Q_8\), Theoretical Computer Science 800 (2019) 155-172, Abstract, 0, 0, DOI

  2. J.-É. Pin and C. Reutenauer, A Mahler's theorem for word functions, 46th ICALP (ICALP 2019), Leibniz International Proceedings in Informatics (LIPIcs), Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini and Stefano Leonardi eds, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik 132 (2019) 125:1--125:13 Abstract, 0 [0] 0, DOI

  3. J.-É. Pin, The influence of Imre Simon's work in the theory of automata, languages and semigroups, Semigroup Forum 98 (2019) 1-8 Abstract, 0 0, DOI

  4. H. Basold, H. H. Hansen, J.-É. Pin and J. Rutten, 0 Newton series, coinductively: a comparative study of composition, Math. Struct. in Comp. Science (2019) 38-66. Abstract, 0, 0 DOI

    2018

  5. M. Branco and J.-É. Pin, Inequalities for one-step products, In: M. Hoshi and S. Seki (Eds.), DLT 2018, Lecture Notes in Computer Science 11088 (2018) 156-168. Abstract, 0 0, DOI

  6. O. Carton, D. Perrin and J.-É. Pin, A survey on difference hierarchies of regular languages, Logical Methods in Computer Science 14 (2018) 1-23. Abstract, 0 [0] 0, DOI

    2017

  7. J.-É. Pin, 0 Some Results of Zoltán Ésik on Regular Languages, In: Klasing R., Zeitoun M. (eds) FCT 2017, Lecture Notes in Computer Science 10472 (2017) 34-37. Abstract, 0, DOI

  8. J.-É. Pin, Dual space of a lattice as the completion of a Pervin space, RAMICS 2017, Lecture Notes in Computer Science 10226 (2017) 24-40, Abstract, 0 0, DOI

  9. J. Almeida, Z. Ésik and J.-É. Pin, Commutative positive varieties of languages, Acta Cybernetica 23 (2017) 91-111 Abstract, 0 [0] 0, DOI

  10. J.-É. Pin, Open problems about regular languages, 35 years later, The Role of Theory in Computer Science, Essays Dedicated to Janusz Brzozowski, World Scientific (2017), 153-176 Abstract, 0 0, DOI

  11. J.-É. Pin, The dot-depth hierarchy, 45 years later, The Role of Theory in Computer Science, Essays Dedicated to Janusz Brzozowski, World Scientific (2017), 177-202 Abstract, 0 0, DOI

  12. J.-É. Pin and P. Silva, On uniformly continuous functions for some profinite topologies, Theoretical Computer Science 658 (2017), 246-262. Abstract, 0 0, DOI

    2016

  13. L. Daviaud, D. Kuperberg, J.-É. Pin, Varieties of cost functions, STACS 2016, N. Ollinger and H. Vollmer (ed.), LIPIcs 47 (2016) 30 :1-30 :14 Abstract, 0 0, DOI

  14. M. Gehrke, A. Krebs, and J.-É. Pin, Ultrafilters on words for a fragment of logic, Theoretical Computer Science 610, Part A, 37-58 (2016). Abstract, 0 0, DOI

    2015

  15. H. Basold, H. H. Hansen, J.-É. Pin and J. Rutten, Newton series, coinductively, ICTAC 2015, Lecture Notes in Computer Science 9399 (2015), 91-109. Abstract, 0 0, DOI

  16. J.-É. Pin, Newton's forward difference equation for functions from words to words, CiE 2015, Lecture Notes in Computer Science 9136 (2015), 71-82. Abstract, 0 0, DOI

  17. J. Almeida, A. Cano, O. Klíma and J.-É. Pin, Fixed points of the lower set operator, Internat. J. Algebra Comput. 25 (2015), 259-292. Abstract, 0 0, DOI

  18. A. Ballester-Bolinches, J.-É. Pin and X. Soler-Escrivà, Languages associated with saturated formations of groups, Forum Math. 27 (2015), 1471-1505, Abstract, 0 [0] 0, DOI

    2014

  19. M. Gehrke, A. Krebs, and J.-É. Pin, From ultrafilters on words to the expressive power of a fragment of logic, Descriptional Complexity of Formal Systems, Lecture Notes in Computer Science 8614, (2014), 138-149. Abstract, 0 0, DOI

  20. J.-É. Pin and P.V. Silva, A noncommutative extension of Mahler's theorem on interpolation series, European Journal of Combinatorics, 36, (2014), 564-578. Abstract, 0 [0] 0, DOI

  21. A. Ballester-Bolinches, J.-É. Pin and X. Soler-Escrivà, Formations of finite monoids and formal languages: Eilenberg's variety theorem revisited, Forum Math. 26 (2014), 1737-1761 Abstract, 0 [0] 0, DOI

    2013

  22. A. Cano, G. Guaiana and J.-É. Pin, Regular languages and partial commutations, Information and Computation, 230, (2013), 76-96. Abstract, 0 [0] 0, DOI

  23. J.-É. Pin, An explicit formula for the intersection of two polynomials of regular languages, Developments in Language Theory, - 17th International Conference, DLT 2013, Lecture Notes in Computer Science 7907, Springer Verlag, (2013), 31-45. Abstract, 0 0, DOI

    2012

  24. J.-É. Pin, Equational descriptions of languages, Int. J. Found. Comput. S. 23, (2012), 1227-1240. Abstract, 0 0, DOI

  25. A. Cano and J.-É. Pin, Upper set monoids and length preserving morphisms, Journal of Pure and Applied Algebra 216, (2012), 1178-1183. Abstract, 0 [0] 0, DOI

    2011

  26. J.-É. Pin, Theme and variations on the concatenation product, CAI 2011, Lecture Notes in Computer Science 6742, Springer Verlag (2011), 44-64. Abstract, Revised version 0 0, DOI

  27. J.-É. Pin and P.V. Silva, On profinite uniform structures defined by varieties of finite monoids, International Journal of Algebra and Computation, 21, (2011), 295-314. Abstract, 0 0, DOI

    2010

  28. J. Berstel, L. Boasson, O. Carton, J.-É. Pin and A. Restivo, The expressive power of the shuffle product, Information and Computation 208 (2010), 1258-1272. Abstract, 0 [0] 0, DOI

  29. M. Gehrke, S. Grigorieff, J.-É. Pin, A topological approach to recognition, ICALP 2010, Part II, Lecture Notes in Computer Science 6199, Springer Verlag, (2010), 151-162. Abstract, 0 0, DOI

  30. M. Golovkins and J.-É. Pin, Varieties generated by certain models of reversible finite automata, Chicago Journal of Theoretical Computer Science 2, June (2010). Abstract, 0 [0] 0, DOI

  31. J.-É. Pin, Automates réversibles: combinatoire, algèbre et topologie, Leçons de mathématiques d'aujourd'hui, édité par E. Charpentier, Cassini, 2010 Abstract, 0 0

    2009

  32. M. J. J. Branco and J.-É. 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, 0 0, DOI

  33. J.-É. 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, 0 0, DOI

  34. O. Carton, J.-É. Pin, X. Soler-Escrivà, Languages recognized by finite supersoluble groups. Journal of Automata, Languages and Combinatorics, 14 (2009), 149-161. Abstract, 0 0, DOI

    2008

  35. A. Cano Gómez and J.-É. Pin, A robust class of regular languages, MFCS 2008, Lecture Notes in Computer Science 5162, Springer Verlag, (2008), 36-51. Abstract, 0 0, DOI

  36. A. Cano Gómez, G. Guaiana, J.-É. Pin, When does partial commutative closure preserve regularity?, ICALP 2008, Part II, Lecture Notes in Computer Science 5126, Springer Verlag, (2008), 209-220. Abstract, 0 0, DOI

  37. M. Gehrke, S. Grigorieff, J.-É. Pin, Duality and equational theory of regular languages, Best paper award of ICALP 2008, Track B, ICALP 2008, Part II, Lecture Notes in Computer Science 5126, Springer Verlag, (2008), 246-257. Abstract, 0 0, DOI

  38. J.-É. 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, 0 0, DOI

    2007

  39. O. Carton, D. Perrin, J.-É. 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, 0 0, DOI

  40. L. Chaubard and J.-É. 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 et J. Meakin (ed.) (2007), 39-56, Word Scientific. Abstract, 0 0, DOI

    2006

  41. J.-É. 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, 0 0, DOI

  42. J.-É. 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, 0 0, DOI

  43. L. Chaubard, J.-É. 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, 0 0, DOI

  44. M. Golovkins and J.-É. Pin, Varieties generated by certain models of reversible finite automata, COCOON 2006, Lecture Notes in Computer Science 4112 (2006), 83-93. Abstract, 0 0, DOI

  45. L. Chaubard, J.-É. Pin, and H. Straubing, Actions, Wreath Products of C-varieties and Concatenation Product, Theoretical Computer Science 356 (2006), 73-89. Abstract, 0 [0] 0, DOI

  46. J. Berstel, L. Boasson, O. Carton, B. Petazzoni and J.-É. Pin, Operations preserving recognizable languages, (Full version), Theoretical Computer Science 354 (2006), 405-420. Abstract, 0 [0] 0, DOI

  47. G. Gomes, J.-É. Pin, and H. Sezinando, Presentations of the Schützenberger product of \(n\) groups, Communications in Algebra 34 (2006) 1213--1235. Abstract, 0 0, DOI

    2005

  48. J.-É. Pin and P. Silva, A topological approach to transductions, Theoretical Computer Science 340 (2005) 443-456. Abstract, PostScript gzipped file, 0 [0] 0, DOI

  49. J.-É. Pin and H. Straubing, Some results on C-varieties, Theoret. Informatics Appl. 39 (2005) 239-262. Abstract, PostScript gzipped file, 0, DOI

  50. J.-É. 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, 0 [0] 0, DOI

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

    2004

  52. S.W. Margolis, J.-É. Pin and M.V. Volkov, Words guaranteeing minimal image, International Journal of Foundations of Computer Science 15, (2004), 259-276. Abstract, 0 0, DOI

  53. A. Cano Gómez and J.-É. Pin, Shuffle on positive varieties of languages, Theoretical Computer Science 312, (2004), 433-461. Abstract, 0 [0] 0, DOI

  54. J. Fountain, J.-É. Pin and P. Weil, Covers for monoids, J. of Algebra 271, (2004), 529-586. Abstract, 0 [0] 0[0], DOI

    2003

  55. J. Berstel, L. Boasson, O. Carton, B. Petazzoni and J.-É. 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, 0 0, DOI

  56. A. Cano Gómez and J.-É. 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, 0 0, DOI

  57. S.W. Margolis, J.-É. 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, 0 0, DOI

  58. J.-É. Pin, Algebraic tools for the concatenation product, Theoretical Computer Science 292, (2003), 317-342. Abstract, PostScript gzipped file, 0 [0] 0, DOI

    2002

  59. J.-É. Pin and P. Weil, The wreath product principle for ordered semigroups, Communications in Algebra 30, (2002), 5677-5713 Abstract, 0 0, DOI

  60. J.-É. Pin, A. Pinguet and P. Weil, Ordered categories and ordered semigroups, Communications in Algebra 30, (2002), 5651-5675. Abstract, PostScript gzipped file, 0 0, DOI

  61. J.-É. Pin and P. Weil, Semidirect products of ordered semigroups, Communications in Algebra 30, (2002), 149-169. Abstract, PostScript gzipped file, 0 0, DOI

    2001

  62. J.-É. Pin and P. Weil, A conjecture on the concatenation product, Theoret. Informatics Appl. 35, (2001), 597-618. Abstract, PostScript gzipped file, 0 0, DOI

    2000

  63. K. Henckell and J.-É. 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, 0 0, DOI

    1999

  64. J.-É. Pin and P. Weil, Uniformities on free semigroups, International Journal of Algebra and Computation, 9, (1999), 431-453. Abstract, 0 0, DOI

    1998

  65. J.-É. Pin, Bridges for concatenation hierarchies, in 25th ICALP, Berlin, Lecture Notes in Computer Science 1443, Springer Verlag, (1998), 431-442. Abstract, 0 0, DOI

  66. J.-É. Pin, Positive varieties and infinite words, in LATIN 98, Berlin, Lecture Notes in Computer Science 1380, (1998), 76-87, Springer Verlag. Abstract, 0 0, DOI

  67. J.-É. Pin, Tropical Semirings, in Idempotency, J. Gunawardena (éd.), Cambridge University Press, (1998), 50-69. Abstract, 0 0, DOI

    1997

  68. J.-É. Pin and P. Weil, Polynomial closure and unambiguous product, Theory Comput. Systems 30, (1997), 383-422. Abstract, 0 0, DOI

  69. J.-É. Pin, Syntactic semigroups, Chap. 10 in Handbook of language theory, Vol. I, G. Rozenberg and A. Salomaa (éd.), Springer Verlag, (1997), 679-746. Abstract, 0 0, DOI

  70. V. Froidure and J.-É. 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, 0 0, DOI

    1996

  71. J.-É. Pin and P. Weil, A Reiterman theorem for pseudovarieties of finite first-order structures, Algebra Universalis 35 (1996), 577-595. Abstract, 0 0, DOI

  72. J.-É. Pin and P. Weil, Profinite semigroups, Mal'cev products and identities, J. of Algebra 182 (1996), 604-626. Abstract, PostScript gzipped file, 0 [0] 0, DOI

  73. J.-É. 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, 0 [0], DOI

  74. J.-É. Pin, Logic, Semigroups and Automata on Words, Annals of Mathematics and Artificial Intelligence 16 (1996), 343-384. Abstract, PostScript gzipped file, 0, DOI

  75. J.-É. 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, 0, DOI

  76. J.-É. 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, 0, DOI

  77. J. Berstel and J.-É. Pin, Local languages and the Berry-Sethi algorithm, Theoretical Computer Science 155, (1996), 439-446. Abstract, PostScript gzipped file, 0 [0], DOI

  78. C. Antoine, B. Le Goff and J.-É. Pin, A graphic language based on timing diagrams, Sadhana, Journal of Engineering Sciences of the Indian Academy of Sciences 21 (1996), 125-145. Abstract, 0, DOI

    1995

  79. J.-É. 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, 0, DOI

  80. J.-É. Pin, A variety theorem without complementation, Russian Mathematics (Izvestija vuzov.Matematika) 39 (1995), 80-90. Abstract, 0,

  81. J.-É. Pin, PG = BG, a success story, in NATO Advanced Study Institute, Semigroups, Formal Languages and Groups, J. Fountain (ed.), Kluwer academic publishers (1995) 33-47. Abstract, 0,

  82. J.-É. Pin, A negative answer to a question of Wilke on varieties of omega-languages, Information Processing Letters 56, (1995), 197-200. Abstract, 0 [0], DOI

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

  84. D. Perrin and J.-É. Pin, Semigroups and automata on infinite words, in NATO Advanced Study Institute, Semigroups, Formal Languages and Groups, J. Fountain (éd.), Kluwer academic publishers, (1995) 1-32,. Abstract, 0,

  85. I. Guessarian and J.-É. Pin, Linearizing some recursive logic programs, IEEE Transactions on Knowledge and Data Engineering 7 (1995), 137-149. Abstract, 0 0, DOI

    1994

  86. J.-É. 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, [Notice 0], DOI

  87. J.-É. 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, 0 0, DOI

    1993

  88. J.-É. Pin and D. Thérien, The bideterministic concatenation product, International Journal of Algebra and Computation 3 (1993), 535-555. Abstract, 0 0, DOI

  89. J.-É. Pin, [Notice 0] Topologie \(p\)-adique sur les mots, Journal de théorie des nombres de Bordeaux 5 (1993), 263-281. Abstract, [0], Numdam

  90. J. Cohen, D. Perrin and J.-É. Pin, On the expressive power of temporal logic for finite words, Journal of Computer and System Sciences 46 (1993), 271-294. Abstract, 0 [0] 0, DOI

  91. C. Antoine, B. Le Goff and J.-É. 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, 0, DOI

    1992

  92. J.-É. Pin, H. Straubing and D. Thérien, Some results on the generalized star-height problem, Information and Computation 101 (1992), 219-250. Abstract, 0 [0] 0, DOI

  93. J.-É. Pin, On reversible automata, in Proceedings of the first LATIN conference, Saõ-Paulo, (1992), 401-416, Lecture Notes in Computer Science 583, Springer. Abstract, 0 0, DOI

  94. S. W. Margolis and J.-É. Pin, New results on the conjecture of Rhodes and on the topological conjecture, Journal of Pure and Applied Algebra 80 (1992), 305-313. Abstract, 0 [0], DOI

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

  96. J. Almeida, J.-É. Pin and P. Weil, Semigroups whose idempotents form a subsemigroup, Math. Proc. Cambridge Phil. Soc. 111 (1992), 241-253. Abstract, 0 0, DOI

    1991

  97. J.-É. Pin and C. Reutenauer, A conjecture on the Hall topology for the free group, Bull. London Math. Soc. 23 (1991), 356-362. Abstract, 0 0, DOI

  98. J.-É. Pin, Topologies for the free monoid, Journal of Algebra 137 (1991), 297-337. Abstract, [0] [Notice 0], DOI

  99. B. Le Saec, J.-É. Pin and P. Weil, Semigroups with idempotent stabilizers and applications to automata theory, International Journal of Algebra and Computation 1 (1991), 291-314. Abstract, 0 0, DOI

  100. B. Le Saec, J.-É. 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, [Notice 0], DOI

  101. K. Henckell, S. Margolis, J.-É. 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, 0 0, DOI

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

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

  104. D. Beauquier and J.-É. Pin, Languages and scanners, Theoretical Computer Science 84 (1991), 3-21. Abstract, 0 [0], DOI

    1990

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

  106. C. Ash, T. Hall and J.-É. Pin, On the varieties of languages associated to some varieties of finite monoids with commuting idempotents, Information and Computation 86 (1990), 32-42. Abstract, 0 [0], DOI

    1989

  107. J.-É. 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, DOI

  108. J.-É. 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, 0, DOI

  109. J.-É. Pin, On a conjecture of Rhodes, Semigroup Forum 39 (1989), 1-15. Abstract, DOI

  110. J.-M. Champarnaud and J.-É. Pin, A maxmin problem on finite automata, Discrete Applied Mathematics 23 (1989), 91-96. Abstract, 0 [0], DOI

  111. J. Berstel, M. Crochemore and J.-É. Pin, Thue sequence and \(p\)-adic topology of the free monoid, Discrete Mathematics 76 (1989), 89-94. Abstract, 0 [0], DOI

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

    1988

  113. J.-É. Pin, H. Straubing and D. Thérien, Locally trivial categories and unambiguous concatenation, Journal of Pure and Applied Algebra 52 (1988), 297-311. Abstract, [0], DOI

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

    1987

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

  116. J.-É. 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, 0, DOI

  117. S. Margolis and J.-É. Pin, Inverse semigroups and varieties of finite semigroups, J. of Algebra 110 (1987), 306-323. [0], DOI

  118. S. Margolis and J.-É. Pin, Inverse semigroups and extensions of groups by semilattices, J. of Algebra 110 (1987), 277-297. [0], DOI

  119. S. Margolis and J.-É. Pin, Expansions, free inverse semigroups and Schützenberger product, J. of Algebra 110 (1987), 298-305. Abstract, [0], DOI

    1986

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

  121. J.-É. 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).[0], DOI

  122. D. Perrin and J.-É. Pin, First order logic and star-free sets, Journal of Computer and System Sciences 32 (1986), 393-406. [0], DOI

  123. S. Margolis and J.-É. Pin, On varieties of rational languages and variable-length code II, J. of Pure and Applied Algebra 41 (1986), 233-253. [0], DOI

    1985

  124. J.-É. Pin and J. Sakarovitch, Une application de la représentation matricielle des transductions, Theoretical Computer Science 35 (1985), 271-293. [0], DOI

  125. J.-É. 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, DOI

  126. S. Margolis and J.-É. Pin, Products of group languages, in FCT, Berlin, (1985), 285-299, Lecture Notes in Computer Science 199, Springer. Abstract, 0 0, DOI

    1984

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

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

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

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

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

  132. J.-É. Pin, Hiérarchies de concaténation, RAIRO Informatique Théorique 18, (1984), 23-46. Abstract, 0 0, DOI

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

  134. S. Margolis and J.-É. Pin, Power monoids and finite \(\mathcal{J}\)-trivial monoids, Semigroup Forum 29 (1984), 99-108, DOI

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

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

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

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

    1983

  139. J.-É. 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, 0 0, DOI

  140. J.-É. Pin, On two combinatorial problems arising from automata theory, Annals of Discrete Mathematics 17 (1983), 535-548. Abstract, 0 0, DOI

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

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

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

    1982

  144. J.-É. Pin and I. Simon, A note on the triangle conjecture, Journal of Combinatorial Theory series A 32 (1982), 106-109, [0] DOI

  145. J.-É. 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)., DOI

  146. J.-É. Pin, On varieties of rational languages and variable-length codes, Journal of Pure and Applied Algebra 23 (1982), 169-196. [0], DOI

    1981

  147. J.-É. 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. [0],

  148. J.-É. Pin and H. Straubing, Monoids of upper triangular matrices, in Colloquia Mathematica Societatis Janos Bolyal, 259-272, (1981). Abstract, 0 0,

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

  150. J.-É. 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, DOI

  151. J.-É. 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, 0 0, >

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

    1980

  153. J.-É. Pin, Variétés de langages et monoïde des parties, Semigroup Forum 20, 11-47 (1980), DOI

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

    1979

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

  156. J.-É. 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, DOI

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

  158. J.-F. Perrot and J.-É. 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).

    1978

  159. J.-É. 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, 0 0

  160. J.-É. 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, 0 0, DOI

  161. J.-É. Pin, Sur les mots synchronisants dans un automate fini, Elektron. Informationsverarb. Kybernet. 14 (1978), 293-303. Abstract [Notice 0],

  162. J.-É. Pin, Sur le monoïde de \(L^*\) lorsque \(L\) est un langage fini, Theoretical Computer Science 7 (1978), 211-215. Abstract, 0 [0] [Notice 0], DOI

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

  164. D. Perrin and J.-É. 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.

    1977

  165. J.-É. 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, 0 0

  166. J.-É. Pin, Holoïdes factoriels, Studia Scientiarum Mathematicarum Hungarica 12 (1977), 169-184. Abstract, 0 0



Dernière modification 23/12/2015

Valid HTML 4.01!