{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:46:35Z","timestamp":1725536795799},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"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-03816-7_44","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T14:43:03Z","timestamp":1250692983000},"page":"513-524","source":"Crossref","is-referenced-by-count":6,"title":["On FO 2 Quantifier Alternation over Words"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Kufleitner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Weil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1145\/772062.772064","volume":"4","author":"M. Adler","year":"2003","unstructured":"Adler, M., Immerman, N.: An n! lower bound on formula size. ACM Trans. Computational Logic\u00a04, 296\u2013314 (2003)","journal-title":"ACM Trans. Computational Logic"},{"key":"44_CR2","volume-title":"Finite Semigroups and Universal Algebra","author":"J. Almeida","year":"1994","unstructured":"Almeida, J.: Finite Semigroups and Universal Algebra. World Scientific, Singapore (1994)"},{"issue":"3","key":"44_CR3","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1142\/S0129054108005802","volume":"19","author":"V. Diekert","year":"2008","unstructured":"Diekert, V., Gastin, P., Kufleitner, M.: A survey on small fragments of first-order logic over finite words. Internat. J. Found. Comput. Sci.\u00a019(3), 513\u2013548 (2008)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Grohe, M., Schweikardt, N.: The succinctness of first-order logic on linear orders. Logical Methods in Computer Science\u00a01 (2005)","DOI":"10.2168\/LMCS-1(1:6)2005"},{"key":"44_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N. Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Springer, Heidelberg (1999)"},{"key":"44_CR6","unstructured":"Kufleitner, M., Weil, P.: On the lattice of sub-pseudovarieties of DA (to appear)"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Lodaya, K., Pandya, P.K., Shah, S.S.: Marking the chops: an unambiguous temporal logic. In: IFIP TCS 2008, pp. 461\u2013476 (2008)","DOI":"10.1007\/978-0-387-09680-3_31"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Pin, J.-\u00c9.: Varieties of Formal Languages. North Oxford Academic (1986)","DOI":"10.1007\/978-1-4613-2215-3"},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.disc.2004.04.027","volume":"291","author":"J.-\u00c9. Pin","year":"2005","unstructured":"Pin, J.-\u00c9.: Expressive power of existential first-order sentences of B\u00fcchi\u2019s sequential calculus. Discrete Maths\u00a0291, 155\u2013174 (2005)","journal-title":"Discrete Maths"},{"key":"44_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. Algebra\u00a0182, 604\u2013626 (1996)","journal-title":"J. Algebra"},{"key":"44_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":"44_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-46011-X_20","volume-title":"Developments in Language Theory","author":"T. Schwentick","year":"2002","unstructured":"Schwentick, T., Th\u00e9rien, D., Vollmer, H.: Partially-ordered two-way automata: A new characterization of DA. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol.\u00a02295, pp. 239\u2013250. Springer, Heidelberg (2002)"},{"key":"44_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0289-9","volume-title":"Finite Automata, Formal Logic, and Circuit Complexity","author":"H. Straubing","year":"1994","unstructured":"Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Birkh\u00e4user, Basel (1994)"},{"key":"44_CR14","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1142\/9789812776884_0021","volume-title":"Semigroups, Algorithms, Automata and Languages","author":"P. Tesson","year":"2002","unstructured":"Tesson, P., Th\u00e9rien, D.: Diamonds are forever: The variety DA. In: Gomes, G., Ventura, P., Pin, J.-\u00c9. (eds.) Semigroups, Algorithms, Automata and Languages, pp. 475\u2013500. World Scientific, Singapore (2002)"},{"key":"44_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-3(1:4)2007","volume":"3","author":"P. Tesson","year":"2007","unstructured":"Tesson, P., Th\u00e9rien, D.: Logic meets algebra: the case of regular languages. Logical Methods in Computer Science\u00a03, 1\u201337 (2007)","journal-title":"Logical Methods in Computer Science"},{"key":"44_CR16","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. Systems and Science\u00a025, 360\u2013376 (1982)","journal-title":"J. Comput. Systems and Science"},{"key":"44_CR17","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s000120050033","volume":"37","author":"P. Trotter","year":"1997","unstructured":"Trotter, P., Weil, P.: The lattice of pseudovarieties of idempotent semigroups and a non-regular analogue. Algebra Universalis\u00a037, 491\u2013526 (1997)","journal-title":"Algebra Universalis"},{"key":"44_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-74915-8_27","volume-title":"Computer Science Logic","author":"P. Weis","year":"2007","unstructured":"Weis, P., Immerman, N.: Structure theorem and strict alternation hierarchy for FO2 on words. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 343\u2013357. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T13:09:52Z","timestamp":1548421792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}