{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T11:01:56Z","timestamp":1780743716765,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":80,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642214929","type":"print"},{"value":"9783642214936","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21493-6_3","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T12:42:44Z","timestamp":1308573764000},"page":"44-64","source":"Crossref","is-referenced-by-count":3,"title":["Theme and Variations on the Concatenation Product"],"prefix":"10.1007","author":[{"given":"Jean-\u00c9ric","family":"Pin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","volume-title":"Finite semigroups and universal algebra","author":"J. Almeida","year":"1994","unstructured":"Almeida, J.: Finite semigroups and universal algebra. World Scientific Publishing Co. Inc., River Edge (1994); Translated from the, Portuguese original and revised by the author"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1142\/9789812776884_0001","volume-title":"Semigroups, Algorithms, Automata and Languages","author":"J. Almeida","year":"2002","unstructured":"Almeida, J.: Finite semigroups: an introduction to a unified theory of pseudovarieties. In: Gomes, G.M.S., Pin, J.-\u00c9., Silva, P. (eds.) Semigroups, Algorithms, Automata and Languages, pp. 3\u201364. World Scientific, Singapore (2002)"},{"key":"3_CR3","series-title":"NATO Sci. Ser. II Math. Phys. Chem.","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/1-4020-3817-8_1","volume-title":"Structural Theory of Automata, Semigroups, and Universal Algebra","author":"J. Almeida","year":"2005","unstructured":"Almeida, J.: Profinite semigroups and applications. In: Structural Theory of Automata, Semigroups, and Universal Algebra. NATO Sci. Ser. II Math. Phys. Chem., vol.\u00a0207, pp. 1\u201345. Springer, Dordrecht (2005)"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1090\/S0002-9947-08-04712-0","volume":"361","author":"J. Almeida","year":"2009","unstructured":"Almeida, J., Margolis, S., Steinberg, B., Volkov, M.: Representation theory of finite semigroups, semigroup radicals and formal language theory. Trans. Amer. Math. Soc.\u00a0361(3), 1429\u20131461 (2009)","journal-title":"Trans. Amer. Math. Soc."},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/BFb0039607","volume-title":"STACS 87","author":"M. Arfi","year":"1987","unstructured":"Arfi, M.: Polynomial operations on rational languages. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol.\u00a0247, pp. 198\u2013206. Springer, Heidelberg (1987)"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(91)90268-7","volume":"91","author":"M. Arfi","year":"1991","unstructured":"Arfi, M.: Op\u00e9rations polynomiales et hi\u00e9rarchies de concat\u00e9nation. Theoret. Comput. Sci.\u00a091(1), 71\u201384 (1991)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s00208-006-0767-2","volume":"335","author":"K. Auinger","year":"2006","unstructured":"Auinger, K., Steinberg, B.: Varieties of finite supersolvable groups with the M. Hall property. Math. Ann.\u00a0335(4), 853\u2013877 (2006)","journal-title":"Math. Ann."},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-02930-1_10","volume-title":"Automata, Languages and Programming","author":"M.J.. Branco","year":"2009","unstructured":"Branco, M.J., Pin, J.-\u00c9.: Equations for the polynomial closure. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 115\u2013126. Springer, Heidelberg (2009)"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1142\/S0218196797000228","volume":"7","author":"M.J.J. Branco","year":"1997","unstructured":"Branco, M.J.J.: The kernel category and variants of the concatenation product. Internat. J. Algebra Comput.\u00a07(4), 487\u2013509 (1997)","journal-title":"Internat. J. Algebra Comput."},{"issue":"1-3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.tcs.2006.09.017","volume":"369","author":"M.J.J. Branco","year":"2006","unstructured":"Branco, M.J.J.: Two algebraic approaches to variants of the concatenation product. Theoret. Comput. Sci.\u00a0369(1-3), 406\u2013426 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s00233-006-0669-3","volume":"74","author":"M.J.J. Branco","year":"2007","unstructured":"Branco, M.J.J.: Deterministic concatenation product of languages recognized by finite idempotent monoids. Semigroup Forum\u00a074(3), 379\u2013409 (2007)","journal-title":"Semigroup Forum"},{"issue":"R-2","key":"3_CR12","first-page":"33","volume":"10","author":"J.A. Brzozowski","year":"1976","unstructured":"Brzozowski, J.A.: Hierarchies of aperiodic languages. RAIRO Inform. Th\u00e9or.\u00a010(R-2), 33\u201349 (1976)","journal-title":"RAIRO Inform. Th\u00e9or."},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0022-0000(80)90003-3","volume":"20","author":"J.A. Brzozowski","year":"1980","unstructured":"Brzozowski, J.A., Fich, F.E.: Languages of \n                    \n                      \n                    \n                    ${\\cal R}$\n                  -trivial monoids. J. Comput. System Sci.\u00a020(1), 32\u201349 (1980)","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0022-0000(78)90049-1","volume":"16","author":"J.A. Brzozowski","year":"1978","unstructured":"Brzozowski, J.A., Knast, R.: The dot-depth hierarchy of star-free languages is infinite. J. Comput. System Sci.\u00a016(1), 37\u201355 (1978)","journal-title":"J. Comput. System Sci."},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2006.01.039","volume":"356","author":"L. Chaubard","year":"2006","unstructured":"Chaubard, L., Pin, J.-E., Straubing, H.: Actions, Wreath Products of \n                    \n                      \n                    \n                    $\\mathcal{C}$\n                  -varieties and Concatenation Product. Theoret. Comput. Sci.\u00a0356, 73\u201389 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(91)90075-D","volume":"88","author":"S. Cho","year":"1991","unstructured":"Cho, S., Hu\u1ef3nh, D.T.: Finite-automaton aperiodicity is PSPACE-complete. Theoret. Comput. Sci.\u00a088(1), 99\u2013116 (1991)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR17","unstructured":"Cohen, R.S., Brzozowski, J.A.: On Star-Free Events. In: Kinariwala, B.K., Kuo, F.F. (eds.) Proceedings of the Hawaii International Conference on System Sciences, Honolulu, HI, January 29-31, pp. 1\u20134 (1968)"},{"key":"3_CR18","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1976","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0B. Academic Press, New York (1976)"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-70583-3_21","volume-title":"Automata, Languages and Programming","author":"M. Gehrke","year":"2008","unstructured":"Gehrke, M., Grigorieff, S., Pin, J.-\u00c9.: Duality and equational theory of regular languages. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 246\u2013257. Springer, Heidelberg (2008)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/3-540-46541-3_46","volume-title":"STACS 2000","author":"C. Gla\u00dfer","year":"2000","unstructured":"Gla\u00dfer, C., Schmitz, H.: Languages of dot-depth 3\/2. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 555\u2013566. Springer, Heidelberg (2000)"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-46011-X_21","volume-title":"Developments in Language Theory","author":"C. Gla\u00dfer","year":"2002","unstructured":"Gla\u00dfer, C., Schmitz, H.: Level 5\/2 of the straubing-th\u00e9rien hierarchy for two-letter alphabets. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol.\u00a02295, pp. 251\u2013261. Springer, Heidelberg (2002)"},{"issue":"2","key":"3_CR22","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/s00224-007-9002-0","volume":"42","author":"C. Gla\u00dfer","year":"2008","unstructured":"Gla\u00dfer, C., Schmitz, H.: Languages of dot-depth 3\/2. Theory Comput. Syst.\u00a042(2), 256\u2013286 (2008)","journal-title":"Theory Comput. Syst."},{"key":"3_CR23","series-title":"Automata studies","first-page":"3","volume-title":"Representation of events in nerve nets and finite automata","author":"S.C. Kleene","year":"1956","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. Automata studies, pp. 3\u201341. Princeton University Press, Princeton (1956); Annals of mathematics studies, no. 34"},{"issue":"4","key":"3_CR24","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1051\/ita\/1983170403211","volume":"17","author":"R. Knast","year":"1983","unstructured":"Knast, R.: A semigroup characterization of dot-depth one languages. RAIRO Inform. Th\u00e9or.\u00a017(4), 321\u2013330 (1983)","journal-title":"RAIRO Inform. Th\u00e9or."},{"issue":"4","key":"3_CR25","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1051\/ita\/1983170403311","volume":"17","author":"R. Knast","year":"1983","unstructured":"Knast, R.: Some theorems on graph congruences. RAIRO Inform. Th\u00e9or.\u00a017(4), 331\u2013342 (1983)","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BFb0028813","volume-title":"Fundamentals of Computation Theory","author":"S. Margolis","year":"1985","unstructured":"Margolis, S., Pin, J.-E.: Products of group languages. In: Budach, L. (ed.) FCT 1985. LNCS, vol.\u00a0199, pp. 285\u2013299. Springer, Heidelberg (1985)"},{"key":"3_CR27","volume-title":"Counter-free automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-free automata. The MIT Press, Cambridge (1971); With an appendix by William Henneman, M.I.T. Research Monograph, no. 65"},{"key":"3_CR28","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1145\/321510.321513","volume":"16","author":"A.R. Meyer","year":"1969","unstructured":"Meyer, A.R.: A note on star-free events, J. Assoc. Comput. Mach.\u00a016, 220\u2013225 (1969)","journal-title":"Assoc. Comput. Mach."},{"issue":"6","key":"3_CR29","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1051\/ita\/1992260605531","volume":"26","author":"P. P\u00e9ladeau","year":"1992","unstructured":"P\u00e9ladeau, P.: Sur le produit avec compteur modulo un nombre premier. RAIRO Inform. Th\u00e9or. Appl.\u00a026(6), 553\u2013564 (1992)","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"3_CR30","first-page":"1","volume-title":"Handbook of Theoretical Computer Science","author":"D. Perrin","year":"1990","unstructured":"Perrin, D.: Finite automata. In: Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 1\u201357. Elsevier, Amsterdam (1990)"},{"key":"3_CR31","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0022-0000(86)90037-1","volume":"32","author":"D. Perrin","year":"1986","unstructured":"Perrin, D., Pin, J.-E.: First order logic and star-free sets. J.\u00a0Comput. System Sci.\u00a032, 393\u2013406 (1986)","journal-title":"J.\u00a0Comput. System Sci."},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/3-540-10003-2_93","volume-title":"Automata, Languages and Programming","author":"J.-E. Pin","year":"1980","unstructured":"Pin, J.-E.: Propri\u00e9t\u00e9s syntactiques du produit non ambigu. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol.\u00a085, pp. 483\u2013499. Springer, Heidelberg (1980)"},{"key":"3_CR33","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1051\/ita\/1984180100231","volume":"18","author":"J.-E. Pin","year":"1984","unstructured":"Pin, J.-E.: Hi\u00e9rarchies de concat\u00e9nation. RAIRO Informatique Th\u00e9orique\u00a018, 23\u201346 (1984)","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/BFb0015770","volume-title":"Automata, Languages and Programming","author":"J.-E. Pin","year":"1985","unstructured":"Pin, J.-E.: Finite group topology and p-adic topology for free monoids. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol.\u00a0194, pp. 445\u2013455. Springer, Heidelberg (1985)"},{"key":"3_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of formal languages","author":"J.-E. Pin","year":"1986","unstructured":"Pin, J.-E.: Varieties of formal languages. North Oxford, London and Plenum, New-York (1986) (Traduction de Vari\u00e9t\u00e9s de langages formels)"},{"key":"3_CR36","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF02573090","volume":"35","author":"J.-E. Pin","year":"1987","unstructured":"Pin, J.-E.: A property of the Sch\u00fctzenberger product. Semigroup Forum\u00a035, 53\u201362 (1987)","journal-title":"Semigroup Forum"},{"key":"3_CR37","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0021-8693(91)90094-O","volume":"137","author":"J.-E. Pin","year":"1991","unstructured":"Pin, J.-E.: Topologies for the free monoid. J. of Algebra\u00a0137, 297\u2013337 (1991)","journal-title":"J. of Algebra"},{"key":"3_CR38","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-94-011-0149-3_2","volume-title":"NATO Advanced Study Institute Semigroups, Formal Languages and Groups","author":"J.-E. Pin","year":"1995","unstructured":"Pin, J.-E.: PG = BG, a success story. In: Fountain, J. (ed.) NATO Advanced Study Institute Semigroups, Formal Languages and Groups, pp. 33\u201347. Kluwer academic publishers, Dordrecht (1995)"},{"key":"3_CR39","first-page":"80","volume":"39","author":"J.-E. Pin","year":"1995","unstructured":"Pin, J.-E.: A variety theorem without complementation. Russian Mathematics (Iz. VUZ)\u00a039, 80\u201390 (1995)","journal-title":"Russian Mathematics (Iz. VUZ)"},{"key":"3_CR40","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02127803","volume":"16","author":"J.-E. Pin","year":"1996","unstructured":"Pin, J.-E.: Logic, Semigroups and Automata on Words. Annals of Mathematics and Artificial Intelligence\u00a016, 343\u2013384 (1996)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"3_CR41","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(96)00120-X","volume":"169","author":"J.-E. Pin","year":"1996","unstructured":"Pin, J.-E.: Polynomial closure of group languages and open sets of the Hall topology. Theoret. Comput. Sci.\u00a0169, 185\u2013200 (1996); Journal version of the article of ICALP 1994","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR42","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-642-59136-5_10","volume-title":"Handbook of Formal Languages","author":"J.-E. Pin","year":"1997","unstructured":"Pin, J.-E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, ch.\u00a010, pp. 679\u2013746. Springer, Heidelberg (1997)"},{"key":"3_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/BFb0055073","volume-title":"Automata, Languages and Programming","author":"J.-\u00c9. Pin","year":"1998","unstructured":"Pin, J.-\u00c9.: Bridges for concatenation hierarchies. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 431\u2013442. Springer, Heidelberg (1998)"},{"key":"3_CR44","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0304-3975(01)00230-4","volume":"292","author":"J.-E. Pin","year":"2003","unstructured":"Pin, J.-E.: Algebraic tools for the concatenation product. Theoret. Comput. Sci.\u00a0292, 317\u2013342 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR45","first-page":"31","volume-title":"26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009)","author":"J.-E. Pin","year":"2009","unstructured":"Pin, J.-E.: Profinite methods in automata theory. In: Albers, S., Marion, J.-Y. (eds.) 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), pp. 31\u201350. Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI), Schloss Dagstuhl (2009)"},{"key":"3_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BFb0036488","volume-title":"Theoretical Computer Science","author":"J.-E. Pin","year":"1982","unstructured":"Pin, J.-E., Sakarovitch, J.: Some operations and transductions that preserve rationality. In: Cremers, A.B., Kriegel, H.-P. (eds.) GI-TCS 1983. LNCS, vol.\u00a0145, pp. 277\u2013288. Springer, Heidelberg (1982)"},{"key":"3_CR47","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0304-3975(85)90019-2","volume":"35","author":"J.-E. Pin","year":"1985","unstructured":"Pin, J.-E., Sakarovitch, J.: Une application de la repr\u00e9sentation matricielle des transductions. Theoret. Comput. Sci.\u00a035, 271\u2013293 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR48","series-title":"Colloq. Math. Soc. J\u00e1nos Bolyai","first-page":"259","volume-title":"Semigroups (Szeged 1981)","author":"J.-E. Pin","year":"1985","unstructured":"Pin, J.-E., Straubing, H.: Monoids of upper triangular boolean matrices. In: Semigroups (Szeged 1981). Colloq. Math. Soc. J\u00e1nos Bolyai, vol.\u00a039, pp. 259\u2013272. North-Holland, Amsterdam (1985)"},{"key":"3_CR49","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1051\/ita:2005014","volume":"39","author":"J.-E. Pin","year":"2005","unstructured":"Pin, J.-E., Straubing, H.: Some results on \n                    \n                      \n                    \n                    $\\mathcal{C}$\n                  -varieties. Theoret. Informatics Appl.\u00a039, 239\u2013262 (2005)","journal-title":"Theoret. Informatics Appl."},{"key":"3_CR50","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0022-4049(88)90097-7","volume":"52","author":"J.-E. Pin","year":"1988","unstructured":"Pin, J.-E., Straubing, H., Th\u00e9rien, D.: Locally trivial categories and unambiguous concatenation. J. of Pure and Applied Algebra\u00a052, 297\u2013311 (1988)","journal-title":"J. of Pure and Applied Algebra"},{"key":"3_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-60084-1_87","volume-title":"Automata, Languages and Programming","author":"J.-E. Pin","year":"1995","unstructured":"Pin, J.-E., Weil, P.: Polynomial closure and unambiguous product. In: F\u00fcl\u00f6p, Z. (ed.) ICALP 1995. LNCS, vol.\u00a0944, pp. 348\u2013359. Springer, Heidelberg (1995)"},{"key":"3_CR52","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1006\/jabr.1996.0192","volume":"182","author":"J.-E. Pin","year":"1996","unstructured":"Pin, J.-E., Weil, P.: Profinite semigroups, Mal\u2019cev products and identities. J. of Algebra\u00a0182, 604\u2013626 (1996)","journal-title":"J. of Algebra"},{"key":"3_CR53","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/BF01243597","volume":"35","author":"J.-E. Pin","year":"1996","unstructured":"Pin, J.-E., Weil, P.: A Reiterman theorem for pseudovarieties of finite first-order structures. Algebra Universalis\u00a035, 577\u2013595 (1996)","journal-title":"Algebra Universalis"},{"key":"3_CR54","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF02679467","volume":"30","author":"J.-E. Pin","year":"1997","unstructured":"Pin, J.-E., Weil, P.: Polynomial closure and unambiguous product. Theory Comput. Systems\u00a030, 383\u2013422 (1997)","journal-title":"Theory Comput. Systems"},{"key":"3_CR55","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1051\/ita:2001134","volume":"35","author":"J.-E. Pin","year":"2001","unstructured":"Pin, J.-E., Weil, P.: A conjecture on the concatenation product. Theoret. Informatics Appl.\u00a035, 597\u2013618 (2001)","journal-title":"Theoret. Informatics Appl."},{"key":"3_CR56","doi-asserted-by":"publisher","first-page":"5677","DOI":"10.1081\/AGB-120016005","volume":"30","author":"J.-E. Pin","year":"2002","unstructured":"Pin, J.-E., Weil, P.: The wreath product principle for ordered semigroups. Communications in Algebra\u00a030, 5677\u20135713 (2002)","journal-title":"Communications in Algebra"},{"issue":"1","key":"3_CR57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02483902","volume":"14","author":"J. Reiterman","year":"1982","unstructured":"Reiterman, J.: The Birkhoff theorem for finite algebras. Algebra Universalis\u00a014(1), 1\u201310 (1982)","journal-title":"Algebra Universalis"},{"key":"3_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/3-540-09118-1_27","volume-title":"Theoretical Computer Science","author":"C. Reutenauer","year":"1979","unstructured":"Reutenauer, C.: Sur les vari\u00e9t\u00e9s de langages et de mono\u00efdes. In: Weihrauch, K. (ed.) GI-TCS 1979. LNCS, vol.\u00a067, pp. 260\u2013265. Springer, Heidelberg (1979)"},{"key":"3_CR59","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of automata theory","author":"J. Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of automata theory. Cambridge University Press, Cambridge (2009); Translated from the, French original by Reuben Thomas"},{"key":"3_CR60","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"M.-P. Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.-P.: On finite monoids having only trivial subgroups. Information and Control\u00a08, 190\u2013194 (1965)","journal-title":"Information and Control"},{"key":"3_CR61","first-page":"331","volume":"18","author":"M.-P. Sch\u00fctzenberger","year":"1976","unstructured":"Sch\u00fctzenberger, M.-P.: Sur le produit de concat\u00e9nation non ambigu. Semigroup Forum\u00a018, 331\u2013340 (1976)","journal-title":"Semigroup Forum"},{"key":"3_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume-title":"Automata Theory and Formal Languages","author":"I. Simon","year":"1975","unstructured":"Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol.\u00a033, pp. 214\u2013222. Springer, Heidelberg (1975)"},{"key":"3_CR63","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/3-540-56939-1_92","volume-title":"Automata, Languages and Programming","author":"I. Simon","year":"1993","unstructured":"Simon, I.: The product of rational languages. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol.\u00a0700, pp. 430\u2013444. Springer, Heidelberg (1993)"},{"issue":"5","key":"3_CR64","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1142\/S0218196700000285","volume":"10","author":"B. Steinberg","year":"2000","unstructured":"Steinberg, B.: Polynomial closure and topology. Internat. J. Algebra Comput.\u00a010(5), 603\u2013624 (2000)","journal-title":"Internat. J. Algebra Comput."},{"issue":"1","key":"3_CR65","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0304-3975(85)90003-9","volume":"35","author":"J. Stern","year":"1985","unstructured":"Stern, J.: Characterizations of some classes of regular events. Theoret. Comput. Sci.\u00a035(1), 17\u201342 (1985)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"3_CR66","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0022-4049(79)90024-0","volume":"15","author":"H. Straubing","year":"1979","unstructured":"Straubing, H.: Families of recognizable sets corresponding to certain varieties of finite monoids. J. Pure Appl. Algebra\u00a015(3), 305\u2013318 (1979)","journal-title":"J. Pure Appl. Algebra"},{"issue":"2","key":"3_CR67","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(81)90036-0","volume":"13","author":"H. Straubing","year":"1981","unstructured":"Straubing, H.: A generalization of the Sch\u00fctzenberger product of finite monoids. Theoret. Comput. Sci.\u00a013(2), 137\u2013150 (1981)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"3_CR68","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1051\/ita\/1981150201491","volume":"15","author":"H. Straubing","year":"1981","unstructured":"Straubing, H.: Relational morphisms and operations on recognizable sets. RAIRO Inform. Th\u00e9or.\u00a015(2), 149\u2013159 (1981)","journal-title":"RAIRO Inform. Th\u00e9or."},{"issue":"1","key":"3_CR69","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0022-4049(85)90062-3","volume":"36","author":"H. Straubing","year":"1985","unstructured":"Straubing, H.: Finite semigroup varieties of the form V * D. J. Pure Appl. Algebra\u00a036(1), 53\u201394 (1985)","journal-title":"J. Pure Appl. Algebra"},{"issue":"1-3","key":"3_CR70","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(88)90034-5","volume":"58","author":"H. Straubing","year":"1988","unstructured":"Straubing, H.: Semigroups and languages of dot-depth two. Theoret. Comput. Sci.\u00a058(1-3), 361\u2013378 (1988); Thirteenth International Colloquium on Automata, Languages and Programming (Rennes, 1996)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR71","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/3-540-45995-2_46","volume-title":"LATIN 2002: Theoretical Informatics","author":"H. Straubing","year":"2002","unstructured":"Straubing, H.: On logical descriptions of regular languages. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 528\u2013538. Springer, Heidelberg (2002)"},{"key":"3_CR72","first-page":"475","volume-title":"Semigroups, Algorithms, Automata and Languages","author":"P. Tesson","year":"2001","unstructured":"Tesson, P., Therien, D.: Diamonds Are Forever: The Variety DA. In: Semigroups, Algorithms, Automata and Languages, Coimbra, Portugal, pp. 475\u2013500. World Scientific, Singapore (2001)"},{"key":"3_CR73","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/3-540-09510-1_49","volume-title":"Automata, Languages, and Programming","author":"D. Th\u00e9rien","year":"1979","unstructured":"Th\u00e9rien, D.: Languages of Nilpotent and Solvable Groups (Extended Abstract). In: Maurer, H.A. (ed.) ICALP 1979. LNCS, vol.\u00a071, pp. 616\u2013632. Springer, Heidelberg (1979)"},{"issue":"2","key":"3_CR74","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0304-3975(81)90057-8","volume":"14","author":"D. Th\u00e9rien","year":"1981","unstructured":"Th\u00e9rien, D.: Classification of finite monoids: the language approach. Theoret. Comput. Sci.\u00a014(2), 195\u2013208 (1981)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-2","key":"3_CR75","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF02572822","volume":"26","author":"D. Th\u00e9rien","year":"1983","unstructured":"Th\u00e9rien, D.: Sur les mono\u00efdes dont tous les groupes sont r\u00e9solubles. Semigroup Forum\u00a026(1-2), 89\u2013101 (1983)","journal-title":"Semigroup Forum"},{"issue":"1-3","key":"3_CR76","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF02572486","volume":"28","author":"D. Th\u00e9rien","year":"1984","unstructured":"Th\u00e9rien, D.: A language theoretic interpretation of the Sch\u00fctzenberger representations with applications to certain varieties of languages. Semigroup Forum\u00a028(1-3), 235\u2013248 (1984)","journal-title":"Semigroup Forum"},{"issue":"3","key":"3_CR77","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/0022-0000(82)90016-2","volume":"25","author":"W. Thomas","year":"1982","unstructured":"Thomas, W.: Classifying regular events in symbolic logic. J. Comput. System Sci.\u00a025(3), 360\u2013376 (1982)","journal-title":"J. Comput. System Sci."},{"key":"3_CR78","first-page":"315","volume-title":"Lattices, Semigroups, and Universal Algebra","author":"P. Weil","year":"1988","unstructured":"Weil, P.: An extension of the Sch\u00fctzenberger product. In: Lattices, Semigroups, and Universal Algebra, Lisbon, pp. 315\u2013321. Plenum, New York (1988)"},{"key":"3_CR79","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0304-3975(90)90019-E","volume":"76","author":"P. Weil","year":"1990","unstructured":"Weil, P.: Products of languages with counter. Theoret. Comput. Sci.\u00a076, 251\u2013260 (1990)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR80","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/0022-0000(92)90029-I","volume":"45","author":"P. Weil","year":"1992","unstructured":"Weil, P.: Closure of varieties of languages under products with counter. J. Comput. System Sci.\u00a045, 316\u2013339 (1992)","journal-title":"J. Comput. System Sci."}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21493-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T07:45:26Z","timestamp":1553845526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21493-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214929","9783642214936"],"references-count":80,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21493-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}