{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:31:51Z","timestamp":1742934711912,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214993"},{"type":"electronic","value":"9783319215006"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_4","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"58-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Decidability of Intermediate Levels of Concatenation Hierarchies"],"prefix":"10.1007","author":[{"given":"Jorge","family":"Almeida","sequence":"first","affiliation":[]},{"given":"Jana","family":"Barto\u0148ov\u00e1","sequence":"additional","affiliation":[]},{"given":"Ond\u0159ej","family":"Kl\u00edma","sequence":"additional","affiliation":[]},{"given":"Michal","family":"Kunc","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"issue":"Suppl","key":"4_CR1","first-page":"531","volume":"54","author":"J Almeida","year":"1999","unstructured":"Almeida, J.: Some algorithmic problems for pseudovarieties. Publ. Math. Debrecen 54(Suppl), 531\u2013552 (1999)","journal-title":"Publ. Math. Debrecen"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Almeida, J.: Profinite semigroups and applications. In: Kudryavtsev, V.B., Rosenberg, I.G. (eds.) Structural Theory of Automata, Semigroups and Universal Algebra, pp. 1\u201345. Springer (2005)","DOI":"10.1007\/1-4020-3817-8_1"},{"key":"4_CR3","first-page":"41","volume":"12","author":"J Almeida","year":"2010","unstructured":"Almeida, J., Kl\u00edma, O.: New decidable upper bound of the second level in the Straubing-Th\u00e9rien concatenation hierarchy of star-free languages. Discrete Math. Theor. Comput. Sci. 12, 41\u201358 (2010)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"4_CR4","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":"MJJ Branco","year":"2009","unstructured":"Branco, M.J.J., Pin, J.\u00c9.: Equations defining the polynomial closure of a lattice of regular languages. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 115\u2013126. Springer, Heidelberg (2009)"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0022-0000(71)80003-X","volume":"5","author":"JA Brzozowski","year":"1971","unstructured":"Brzozowski, J.A., Cohen, R.S.: Dot-depth of star-free events. J. Comput. System Sci. 5, 1\u201315 (1971)","journal-title":"J. Comput. System Sci."},{"key":"4_CR6","unstructured":"McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press (1971)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Pin, J.-\u00c9.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Chapter 10. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_10"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0022-4049(88)90097-7","volume":"52","author":"J\u00c9 Pin","year":"1988","unstructured":"Pin, J.\u00c9., Straubing, H., Th\u00e9rien, D.: Locally trivial categories and unambiguous concatenation. J. Pure Appl. Algebra 52, 297\u2013311 (1988)","journal-title":"J. Pure Appl. Algebra"},{"key":"4_CR9","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. Algebra 182, 604\u2013626 (1996)","journal-title":"J. Algebra"},{"key":"4_CR10","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 30, 383\u2013422 (1997)","journal-title":"Theory Comput. Systems"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Place, T.: Separating regular languages with two quantifier alternations. In: Proc. LICS (2015), to appear","DOI":"10.1109\/LICS.2015.28"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/978-3-662-43951-7_29","volume-title":"Automata, Languages, and Programming","author":"T Place","year":"2014","unstructured":"Place, T., Zeitoun, M.: Going higher in the first-order quantifier alternation hierarchy on words. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 342\u2013353. Springer, Heidelberg (2014)"},{"key":"4_CR13","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 14, 1\u201310 (1982)","journal-title":"Algebra Universalis"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Rhodes, J., Steinberg, B.: The q-theory of Finite Semigroups. Springer (2009)","DOI":"10.1007\/b104443"},{"key":"4_CR15","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. Inform. and Control 8, 190\u2013194 (1965)","journal-title":"Inform. and Control"},{"key":"4_CR16","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 36, 53\u201394 (1985)","journal-title":"J. Pure Appl. Algebra"},{"key":"4_CR17","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. 25, 360\u2013376 (1982)","journal-title":"J. Comput. System Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:34:18Z","timestamp":1674567258000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}