{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T06:07:49Z","timestamp":1776233269378,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642029295","type":"print"},{"value":"9783642029301","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02930-1_10","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:05:04Z","timestamp":1246532704000},"page":"115-126","source":"Crossref","is-referenced-by-count":8,"title":["Equations Defining the Polynomial Closure of a Lattice of Regular Languages"],"prefix":"10.1007","author":[{"given":"M\u00e1rio J. J.","family":"Branco","sequence":"first","affiliation":[]},{"given":"Jean-\u00c9ric","family":"Pin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_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 1992 Portuguese original and revised by the author"},{"issue":"1-3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/S0304-3975(03)00344-X","volume":"310","author":"J. Chalopin","year":"2004","unstructured":"Chalopin, J., Leung, H.: On factorization forests of finite height. Theoret. Comput. Sci.\u00a0310(1-3), 489\u2013499 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1007\/978-3-540-73420-8_77","volume-title":"Automata, Languages and Programming","author":"T. Colcombet","year":"2007","unstructured":"Colcombet, T.: A combinatorial theorem for trees. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 901\u2013912. Springer, Heidelberg (2007)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-74240-1_20","volume-title":"Fundamentals of Computation Theory","author":"T. Colcombet","year":"2007","unstructured":"Colcombet, T.: Factorisation Forests for Infinite Words. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) FCT 2007. LNCS, vol.\u00a04639, pp. 226\u2013237. Springer, Heidelberg (2007)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/978-3-540-70583-3_21","volume-title":"ICALP 2008, Part II","author":"M. Gehrke","year":"2008","unstructured":"Gehrke, M., Grigorieff, S., Pin, J.-\u00c9.: Duality and equational theory of regular languages. In: Aceto, L., et al. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 246\u2013257. Springer, Heidelberg (2008)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-540-85238-4_36","volume-title":"Mathematical Foundations of Computer Science 2008","author":"M. Kufleitner","year":"2008","unstructured":"Kufleitner, M.: The Height of Factorization Forests. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 443\u2013454. Springer, Heidelberg (2008)"},{"key":"10_CR7","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":"10_CR8","unstructured":"Pin, J.-E.: Profinite methods in automata theory. In: Albers, S. (ed.) 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), Schloss Dagstuhl, Germany, Dagstuhl, Germany. Internationales Begegnungs- Und Forschungszentrum f\u00fcr Informatik (IBFI), pp. 31\u201350 (2009)"},{"key":"10_CR9","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":"10_CR10","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1006\/jabr.1996.0192","volume":"182","author":"J.-\u00c9. Pin","year":"1996","unstructured":"Pin, J.-\u00c9., Weil, P.: Profinite semigroups, Mal\u2019cev products and identities. J. of Algebra\u00a0182, 604\u2013626 (1996)","journal-title":"J. of Algebra"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF02679467","volume":"30","author":"J.-\u00c9. Pin","year":"1997","unstructured":"Pin, J.-\u00c9., Weil, P.: Polynomial closure and unambiguous product. Theory Comput. Systems\u00a030, 383\u2013422 (1997)","journal-title":"Theory Comput. Systems"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BFb0013112","volume-title":"Formal Properties of Finite Automata and Applications","author":"I. Simon","year":"1989","unstructured":"Simon, I.: Properties of factorization forests. In: Pin, J.E. (ed.) LITP 1988. LNCS, vol.\u00a0386, pp. 65\u201372. Springer, Heidelberg (1989)"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0304-3975(90)90047-L","volume":"72","author":"I. Simon","year":"1990","unstructured":"Simon, I.: Factorization forests of finite height. Theoret. Comput. Sci.\u00a072(1), 65\u201394 (1990)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR14","series-title":"Stud. Comput. Sci. Artificial Intelligence","first-page":"433","volume-title":"Tree automata and languages (Le Touquet, 1990)","author":"I. Simon","year":"1992","unstructured":"Simon, I.: A short proof of the factorization forest theorem. In: Tree automata and languages (Le Touquet, 1990). Stud. Comput. Sci. Artificial Intelligence, vol.\u00a010, pp. 433\u2013438. North-Holland, Amsterdam (1992)"},{"issue":"3","key":"10_CR15","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":"10_CR16","first-page":"45","volume-title":"Handbook of formal languages, ch. 2","author":"S. Yu","year":"1997","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of formal languages, ch. 2, vol.\u00a01, pp. 45\u2013110. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02930-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T20:56:08Z","timestamp":1552078568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}