Esta página está en construcción. Consulte también los enlaces en la sección de miembros para más información.
This page is under construction. Check also the links in the members section for more information.
Aquesta pàgina està en construcció. Consulteu també els enllaços en la secció de membres per a més informació.
| [1] | María José Felipe, Ana Martínez-Pastor, and Víctor Manuel Ortiz-Sotomayor. Structural criteria in factorised groups via conjugacy class sizes. In Groups St Andrews 2017 in Birmingham, volume 455 of London Math. Soc. Lecture Note Ser., pages 289--299. Cambridge Univ. Press, Cambridge, 2019. |
| [2] | Enric Cosme-Llópez and Damien Pous. K4-free graphs as a free algebra. In 42nd International Symposium on Mathematical Foundations of Computer Science, volume 83 of LIPIcs. Leibniz Int. Proc. Inform., pages Art. No. 76, 14. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2017. [ DOI | Full text (Roderic) | Full text ] |
| [3] | Milagros Arroyo-Jordá, Paz Arroyo-Jordá, Ana Martínez-Pastor, and M. Dolores Pérez-Ramos. New progress on factorized groups and subgroup permutability. In Groups St Andrews 2013, volume 422 of London Math. Soc. Lecture Note Ser., pages 142--151. Cambridge Univ. Press, Cambridge, 2015. |
| [4] | J. Salamanca, A. Ballester-Bolinches, M. M. Bonsangue, E. Cosme-Llópez, and J. J. M. M. Rutten. Regular varieties of automata and coequations. In Mathematics of program construction, volume 9129 of Lecture Notes in Comput. Sci., pages 224--237. Springer, Cham, 2015. [ DOI | Full text (Riunet) | Full text ] |
| [5] | Mai Gehrke, Andreas Krebs, and Jean-Éric Pin. From ultrafilters on words to the expressive power of a fragment of logic. In Descriptional complexity of formal systems, volume 8614 of Lecture Notes in Comput. Sci., pages 138--149. Springer, Cham, 2014. [ DOI | Full text ] |
| [6] | Jan Rutten, Adolfo Ballester-Bolinches, and Enric Cosme-Llópez. Varieties and covarieties of languages (extended abstract). In Proceedings of the Twenty-Ninth Conference on the Mathematical Foundations of Programming Semantics, MFPS XXIX, volume 298 of Electron. Notes Theor. Comput. Sci., pages 7--28. Elsevier Sci. B. V., Amsterdam, 2013. [ DOI | Full text ] |
| [7] | Jean-Éric Pin. An explicit formula for the intersection of two polynomials of regular languages. In Developments in language theory, volume 7907 of Lecture Notes in Comput. Sci., pages 31--45. Springer, Heidelberg, 2013. [ DOI | Full text ] |
| [8] | A. Ballester-Bolinches, R. Esteban-Romero, and Yangming Li. Cover and avoidance properties and the structure of finite groups. In Proceedings of the International Conference on Algebra 2010, pages 26--42. World Sci. Publ., Hackensack, NJ, 2012. [ DOI | Full text ] |
| [9] | L. S. Kazarin, A. Martínez-Pastor, and M. D. Pérez-Ramos. Extending the Kegel Wielandt theorem through π-decomposable groups. In Groups St Andrews 2009 in Bath. Volume 2, volume 388 of London Math. Soc. Lecture Note Ser., pages 415--423. Cambridge Univ. Press, Cambridge, 2011. |
| [10] | Jean-Éric Pin. Theme and variations on the concatenation product. In Algebraic informatics, volume 6742 of Lecture Notes in Comput. Sci., pages 44--64. Springer, Heidelberg, 2011. [ DOI | Full text ] |
| [11] | Mai Gehrke, Serge Grigorieff, and Jean-Éric Pin. A topological approach to recognition. In Automata, languages and programming. Part II, volume 6199 of Lecture Notes in Comput. Sci., pages 151--162. Springer, Berlin, 2010. [ DOI | Full text ] |
| [12] | Jean-Éric Pin. Profinite methods in automata theory. In STACS 2009: 26th International Symposium on Theoretical Aspects of Computer Science, volume 3 of LIPIcs. Leibniz Int. Proc. Inform., pages 31--50. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2009. |
| [13] | A. Ballester-Bolinches, John Cossey, and R. Esteban-Romero. On abnormal maximal subgroups of finite groups. In Ischia group theory 2008, pages 1--6. World Sci. Publ., Hackensack, NJ, 2009. [ DOI | Full text ] |
| [14] | Mário J. J. Branco and Jean-Éric Pin. Equations defining the polynomial closure of a lattice of regular languages. In Automata, languages and programming. Part II, volume 5556 of Lecture Notes in Comput. Sci., pages 115--126. Springer, Berlin, 2009. [ DOI | Full text ] |
| [15] | Jean-Éric Pin and Pedro V. Silva. A Mahler's theorem for functions from words to integers. In STACS 2008: 25th International Symposium on Theoretical Aspects of Computer Science, volume 1 of LIPIcs. Leibniz Int. Proc. Inform., pages 585--596. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2008. |
| [16] | Antonio Cano Gómez and Jean-Éric Pin. A robust class of regular languages. In Mathematical foundations of computer science 2008, volume 5162 of Lecture Notes in Comput. Sci., pages 36--51. Springer, Berlin, 2008. [ DOI | Full text ] |
| [17] | Olivier Carton, Dominique Perrin, and Jean-Éric Pin. Automata and semigroups recognizing infinite words. In Logic and automata, volume 2 of Texts Log. Games, pages 133--167. Amsterdam Univ. Press, Amsterdam, 2008. |
| [18] | Mai Gehrke, Serge Grigorieff, and Jean-Éric Pin. Duality and equational theory of regular languages. In Automata, languages and programming. Part II, volume 5126 of Lecture Notes in Comput. Sci., pages 246--257. Springer, Berlin, 2008. [ DOI | Full text ] |
| [19] | Antonio Cano Gómez, Giovanna Guaiana, and Jean-Éric Pin. When does partial commutative closure preserve regularity? In Automata, languages and programming. Part II, volume 5126 of Lecture Notes in Comput. Sci., pages 209--220. Springer, Berlin, 2008. [ DOI | Full text ] |
| [20] | Laura Chaubard and Jean-Éric Pin. Open problems on regular languages: a historical perspective. In Semigroups and formal languages, pages 39--56. World Sci. Publ., Hackensack, NJ, 2007. [ DOI | Full text ] |
| [21] | B. Brewster, A. Martínez-Pastor, and M. D. Pérez-Ramos. Embedding properties in direct products. In Groups St. Andrews 2005. Vol. 1, volume 339 of London Math. Soc. Lecture Note Ser., pages 246--255. Cambridge Univ. Press, Cambridge, 2007. [ Full text ] |
| [22] | A. Ballester-Bolinches, H. Heineken, and Tatiana Pedraza. Radical locally finite T-groups. In Groups St. Andrews 2005. Vol. 1, volume 339 of London Math. Soc. Lecture Note Ser., pages 203--206. Cambridge Univ. Press, Cambridge, 2007. [ DOI | Full text ] |
| [23] | A. Ballester-Bolinches, John Cossey, and M. C. Pedraza-Aguilera. New results on products of finite groups. In Groups St. Andrews 2005. Vol. 1, volume 339 of London Math. Soc. Lecture Note Ser., pages 199--202. Cambridge Univ. Press, Cambridge, 2007. [ DOI | Full text ] |
| [24] | A. Ballester-Bolinches, Clara Calvo, and R. Esteban-Romero. On one-generated formations. In Groups St. Andrews 2005. Vol. 1, volume 339 of London Math. Soc. Lecture Note Ser., pages 194--198. Cambridge Univ. Press, Cambridge, 2007. [ DOI | Full text ] |
| [25] | Marats Golovkins and Jean-Eric Pin. Varieties generated by certain models of reversible finite automata. In Computing and combinatorics, volume 4112 of Lecture Notes in Comput. Sci., pages 83--93. Springer, Berlin, 2006. [ DOI | Full text ] |
| [26] | Antonio Cano and Pedro García. Finite automata and unions of regular patterns with bounded constant segments. In Implementation and application of automata, volume 3845 of Lecture Notes in Comput. Sci., pages 104--115. Springer, Berlin, 2006. [ DOI | Full text ] |
| [27] | A. Ballester-Bolinches, R. Esteban-Romero, and M. C. Pedraza-Aguilera. On finite groups in which subnormal subgroups satisfy certain permutability conditions. In Advances in algebra, pages 38--45. World Sci. Publ., River Edge, NJ, 2003. |
| [28] | Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, and Jean-Éric Pin. Operations preserving recognizable languages. In Fundamentals of computation theory, volume 2751 of Lecture Notes in Comput. Sci., pages 343--354. Springer, Berlin, 2003. [ DOI | Full text ] |
| [29] | Antonio Cano Gómez and Jean-Éric Pin. On a conjecture of Schnoebelen. In Developments in language theory, volume 2710 of Lecture Notes in Comput. Sci., pages 35--54. Springer, Berlin, 2003. [ DOI | Full text ] |
| [30] | A. Ballester-Bolinches and Tatiana Pedraza. On radical locally finite groups with min-p for all primes p. In Advances in group theory 2002, pages 223--234. Aracne, Rome, 2003. |
| [31] | A. D'Aniello and M. D. Pérez-Ramos. On dual pronormal subgroups and fitting classes. In Groups St. Andrews 2001 in Oxford. Vol. I, volume 304 of London Math. Soc. Lecture Note Ser., pages 92--100. Cambridge Univ. Press, Cambridge, 2003. [ Full text ] |
| [32] | A. Ballester-Bolinches and Tatiana Pedraza. Locally finite groups with min-p for all primes p. In Groups St. Andrews 2001 in Oxford. Vol. I, volume 304 of London Math. Soc. Lecture Note Ser., pages 39--43. Cambridge Univ. Press, Cambridge, 2003. [ DOI | Full text ] |
| [33] | A. Ballester-Bolinches, A. Martínez-Pastor, M. C. Pedraza-Aguilera, and M. D. Pérez-Ramos. On nilpotent-like fitting formations. In Groups St. Andrews 2001 in Oxford. Vol. I, volume 304 of London Math. Soc. Lecture Note Ser., pages 31--38. Cambridge Univ. Press, Cambridge, 2003. [ DOI | Full text ] |
| [34] | A. Ballester-Bolinches, John Cossey, Xiuyun Guo, and M. C. Pedraza-Aguilera. Some results on finite factorized groups. In Groups St. Andrews 2001 in Oxford. Vol. I, volume 304 of London Math. Soc. Lecture Note Ser., pages 27--30. Cambridge Univ. Press, Cambridge, 2003. [ DOI | Full text ] |
| [35] | Manuel J. Alejandre, A. Ballester-Bolinches, R. Esteban-Romero, and M. C. Pedraza-Aguilera. Permutability and subnormality in finite groups. In Groups St. Andrews 2001 in Oxford. Vol. I, volume 304 of London Math. Soc. Lecture Note Ser., pages 1--5. Cambridge Univ. Press, Cambridge, 2003. [ DOI | Full text ] |
| [36] | S. W. Margolis, J.-E. Pin, and M. V. Volkov. Words guaranteeing minimal image. In Words, languages & combinatorics, III (Kyoto, 2000), pages 297--310. World Sci. Publ., River Edge, NJ, 2003. [ DOI | Full text ] |
| [37] | Antonio Cano, José Ruiz, and Pedro García. Inferring subclasses of regular languages faster using RPNI and forbidden configurations. In Grammatical inference: algorithms and applications, volume 2484 of Lecture Notes in Comput. Sci., pages 28--36. Springer, Berlin, 2002. [ DOI | Full text ] |
| [38] | Jean-Eric Pin. Logic on words. In Current trends in theoretical computer science, pages 254--273. World Sci. Publ., River Edge, NJ, 2001. [ DOI | Full text ] |
| [39] | A. Ballester-Bolinches. Totally and mutually permutable products of finite groups. In Mathematics and the 21st century (Cairo, 2000), pages 159--167. World Sci. Publ., River Edge, NJ, 2001. |
| [40] | Karsten Henckell and Jean-Eric Pin. Ordered monoids and J-trivial monoids. In Algorithmic problems in groups and semigroups (Lincoln, NE, 1998), Trends Math., pages 121--137. Birkhäuser Boston, Boston, MA, 2000. |
| [41] | A. Ballester-Bolinches, M. D. Pérez-Ramos, and M. C. Pedraza-Aguilera. Totally and mutually permutable products of finite groups. In Groups St. Andrews 1997 in Bath, I, volume 260 of London Math. Soc. Lecture Note Ser., pages 65--68. Cambridge Univ. Press, Cambridge, 1999. |
| [42] | Jean-Éric Pin. Bridges for concatenation hierarchies. In Automata, languages and programming (Aalborg, 1998), volume 1443 of Lecture Notes in Comput. Sci., pages 431--442. Springer, Berlin, 1998. [ DOI | Full text ] |
| [43] | Jean-Éric Pin. Positive varieties and infinite words. In LATIN'98: theoretical informatics (Campinas, 1998), volume 1380 of Lecture Notes in Comput. Sci., pages 76--87. Springer, Berlin, 1998. [ DOI | Full text ] |
| [44] | Jean-Eric Pin. Tropical semirings. In Idempotency (Bristol, 1994), volume 11 of Publ. Newton Inst., pages 50--69. Cambridge Univ. Press, Cambridge, 1998. [ DOI | Full text ] |
| [45] | Véronique Froidure and Jean-Eric Pin. Algorithms for computing finite semigroups. In Foundations of computational mathematics (Rio de Janeiro, 1997), pages 112--126. Springer, Berlin, 1997. |
| [46] | Jean-Eric Pin. Syntactic semigroups. In Handbook of formal languages, Vol. 1, pages 679--746. Springer, Berlin, 1997. |
| [47] | A. Ballester-Bolinches, M. C. Pedraza-Aguilera, and M. D. Pérez-Ramos. σ-permutably embedded subgroups of finite soluble groups. In Problems in algebra, No. 9 (Russian), pages 38--41. Gomel. Gos. Univ., Gomel', 1996. |
| [48] | Jean-Eric Pin. The expressive power of existential first order sentences of Büchi's sequential calculus. In Automata, languages and programming (Paderborn, 1996), volume 1099 of Lecture Notes in Comput. Sci., pages 300--311. Springer, Berlin, 1996. [ DOI | Full text ] |
| [49] | Jean-Eric Pin. Finite semigroups as categories, ordered semigroups of compact semigroups. In Semigroup theory and its applications (New Orleans, LA, 1994), volume 231 of London Math. Soc. Lecture Note Ser., pages 107--122. Cambridge Univ. Press, Cambridge, 1996. |
| [50] | Dominique Perrin and Jean-Eric Pin. Semigroups and automata on infinite words. In Semigroups, formal languages and groups (York, 1993), volume 466 of NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., pages 49--72. Kluwer Acad. Publ., Dordrecht, 1995. |
| [51] | Jean-Eric Pin. BG=PG: a success story. In Semigroups, formal languages and groups (York, 1993), volume 466 of NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., pages 33--47. Kluwer Acad. Publ., Dordrecht, 1995. |
| [52] | Jean-Eric Pin. Finite semigroups and recognizable languages: an introduction. In Semigroups, formal languages and groups (York, 1993), volume 466 of NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., pages 1--32. Kluwer Acad. Publ., Dordrecht, 1995. |
| [53] | A. Ballester-Bolinches and C. Juan-Martínez. Locally constructed formations of finite groups. In Groups '93 Galway/St. Andrews, Vol. 1 (Galway, 1993), volume 211 of London Math. Soc. Lecture Note Ser., pages 32--36. Cambridge Univ. Press, Cambridge, 1995. [ DOI | Full text ] |
| [54] | A. Ballester-Bolinches and L. M. Ezquerro. On the saturation of formations of finite groups. In Groups '93 Galway/St. Andrews, Vol. 1 (Galway, 1993), volume 211 of London Math. Soc. Lecture Note Ser., pages 23--31. Cambridge Univ. Press, Cambridge, 1995. [ DOI | Full text ] |
| [55] | Jean-Eric Pin. Polynomial closure of group languages and open sets of the Hall topology. In Automata, languages and programming (Jerusalem, 1994), volume 820 of Lecture Notes in Comput. Sci., pages 424--435. Springer, Berlin, 1994. [ DOI | Full text ] |
| [56] | A. Ballester-Bolinches and L. M. Ezquerro. Saturated formations of finite groups and the cover and avoidance property. In Proceedings of the International Conference on Group Theory (Timişoara, 1992), number Special Issue, pages 33--42, 1993. |
| [57] | Jean-Eric Pin. On reversible automata. In LATIN '92 (São Paulo, 1992), volume 583 of Lecture Notes in Comput. Sci., pages 401--416. Springer, Berlin, 1992. [ DOI | Full text ] |
| [58] | D. Beauquier and J.-E. Pin. Languages and scanners. In Words, languages and combinatorics (Kyoto, 1990), pages 16--29. World Sci. Publ., River Edge, NJ, 1992. |
| [59] | Bertrand Le Saëc, Jean-Eric Pin, and Pascal Weil. A purely algebraic proof of McNaughton's theorem on infinite words. In Foundations of software technology and theoretical computer science (New Delhi, 1991), volume 560 of Lecture Notes in Comput. Sci., pages 141--151. Springer, Berlin, 1991. [ DOI | Full text ] |
| [60] | Jean Enric Pin. Rational and recognizable languages. In Lectures in applied mathematics and informatics, pages 62--106. Manchester Univ. Press, Manchester, 1990. |
| [61] | A. Ballester-Bolinches and M. D. Pérez-Ramos. On f-subnormal subgroups. In Proceedings of the Second International Group Theory Conference (Bressanone, 1989), number 23, pages 25--28, 1990. |
| [62] | A. Ballester-Bolinches and L. M. Ezquerro. An analogue of Hall-systems in finite groups. In Proceedings of the Second International Group Theory Conference (Bressanone, 1989), number 23, pages 19--24, 1990. |
| [63] | Jean-Eric Pin. Relational morphisms, transductions and operations on languages. In Formal properties of finite automata and applications (Ramatuelle, 1988), volume 386 of Lecture Notes in Comput. Sci., pages 34--55. Springer, Berlin, 1989. [ DOI | Full text ] |
| [64] | Danièle Beauquier and Jean-Eric Pin. Factors of words. In Automata, languages and programming (Stresa, 1989), volume 372 of Lecture Notes in Comput. Sci., pages 63--79. Springer, Berlin, 1989. [ DOI | Full text ] |
| [65] | J.-E. Pin, H. Straubing, and D. Thérien. New results on the generalized star-height problem. In STACS 89 (Paderborn, 1989), volume 349 of Lecture Notes in Comput. Sci., pages 458--467. Springer, Berlin, 1989. [ DOI | Full text ] |
| [66] | J.-E. Pin. On the languages accepted by finite reversible automata. In Automata, languages and programming (Karlsruhe, 1987), volume 267 of Lecture Notes in Comput. Sci., pages 237--249. Springer, Berlin, 1987. [ DOI | Full text ] |
| [67] | J.-E. Pin. Power semigroups and related varieties of finite semigroups. In Semigroups and their applications (Chico, Calif., 1986), pages 139--152. Reidel, Dordrecht, 1987. |
| [68] | J.-E. Pin and H. Straubing. Monoids of upper triangular matrices. In Semigroups (Szeged, 1981), volume 39 of Colloq. Math. Soc. János Bolyai, pages 259--272. North-Holland, Amsterdam, 1985. |
| [69] | S. W. Margolis and J.-E. Pin. Products of group languages. In Fundamentals of computation theory (Cottbus, 1985), volume 199 of Lecture Notes in Comput. Sci., pages 285--299. Springer, Berlin, 1985. [ DOI | Full text ] |
| [70] | J.-E. Pin. Finite group topology and p-adic topology for free monoids. In Automata, languages and programming (Nafplion, 1985), volume 194 of Lecture Notes in Comput. Sci., pages 445--455. Springer, Berlin, 1985. [ DOI | Full text ] |
| [71] | J.-E. Pin. Star-free ω-languages and first order logic. In Automata on infinite words (Le Mont-Dore, 1984), volume 192 of Lecture Notes in Comput. Sci., pages 56--67. Springer, Berlin, 1985. |
| [72] | S. W. Margolis and J.-E. Pin. Varieties of finite monoids and topology for the free monoid. In Proceedings of the 1984 Marquette conference on semigroups (Milwaukee, Wis., 1984), pages 113--129, Milwaukee, WI, 1985. Marquette Univ. |
| [73] | Stuart W. Margolis and Jean-Eric Pin. Graphs, inverse semigroups and languages. In Proceedings of the 1984 Marquette conference on semigroups (Milwaukee, Wis., 1984), pages 85--111, Milwaukee, WI, 1985. Marquette Univ. |
| [74] | J.-E. Pin. Introduction aux langages reconnaissables. In Avignon conference on language theory and algorithmic complexity (Avignon, 1983), volume 84 of Publ. Dép. Math. Nouvelle Sér. B, pages 13--38. Univ. Claude-Bernard, Lyon, 1984. |
| [75] | S. W. Margolis and J.-E. Pin. Languages and inverse semigroups. In Automata, languages and programming (Antwerp, 1984), volume 172 of Lecture Notes in Comput. Sci., pages 337--346. Springer, Berlin, 1984. [ DOI | Full text ] |
| [76] | Jean-Eric Pin. Concatenation hierarchies: decidability results and problems. In Combinatorics on words (Waterloo, Ont., 1982), pages 195--228. Academic Press, Toronto, ON, 1983. |
| [77] | J.-E. Pin. On two combinatorial problems arising from automata theory. In Combinatorial mathematics (Marseille-Luminy, 1981), volume 75 of North-Holland Math. Stud., pages 535--548. North-Holland, Amsterdam, 1983. |
| [78] | Jean-Eric Pin. Arbres et hiérarchies de concatenation. In Automata, languages and programming (Barcelona, 1983), volume 154 of Lecture Notes in Comput. Sci., pages 617--628. Springer, Berlin, 1983. [ DOI | Full text ] |
| [79] | Jean-Eric Pin. Le problème de la synchronisation et la conjecture de Černý. In Noncommutative structures in algebra and geometric combinatorics (Naples, 1978), volume 109 of Quad. “Ricerca Sci.”, pages 37--48. CNR, Rome, 1981. |
| [80] | Jean-Eric Pin. Propriétés syntactiques du produit non ambigu. In Automata, languages and programming (Proc. Seventh Internat. Colloq., Noordwijkerhout, 1980), volume 85 of Lecture Notes in Comput. Sci., pages 483--499. Springer, Berlin, 1980. |
| [81] | J.-E. Pin. Une caractérisation de trois variétés de langages bien connues. In Theoretical computer science (Fourth GI Conf., Aachen, 1979), volume 67 of Lecture Notes in Comput. Sci., pages 233--243. Springer, Berlin, 1979. |
| [82] | 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, 1979), volume 2 of Math. Res., pages 544--558. Akademie-Verlag, Berlin, 1979. |
| [83] | J.-E. Pin. Sur un cas particulier de la conjecture de Cerny. In Automata, languages and programming (Fifth Internat. Colloq., Udine, 1978), volume 62 of Lecture Notes in Comput. Sci., pages 345--352. Springer, Berlin, 1978. |
This file was generated by bibtex2html 1.99.
