{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:09:07Z","timestamp":1725559747163},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_43","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"526-538","source":"Crossref","is-referenced-by-count":4,"title":["Restricted Two-Variable FO + MOD Sentences, Circuits and Communication Complexity"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Tesson","sequence":"first","affiliation":[]},{"given":"Denis","family":"Th\u00e9rien","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0022-4049(96)00083-7","volume":"123","author":"J. Almeida","year":"1998","unstructured":"Almeida, J., Weil, P.: Profinite categories and semidirect products. J. Pure and Applied Algebra\u00a0123, 1\u201350 (1998)","journal-title":"J. Pure and Applied Algebra"},{"issue":"2","key":"43_CR2","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1137\/0219016","volume":"19","author":"G. Bilardi","year":"1990","unstructured":"Bilardi, G., Preparata, F.: Characterization of associative operations with prefix circuits of constant depth and linear size. SIAM J. Comput.\u00a019(2), 246\u2013255 (1990)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"43_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0890-5401(89)90055-2","volume":"83","author":"N. Immerman","year":"1989","unstructured":"Immerman, N., Kozen, D.: Definability with a bounded number of bound variables. Information and Computation\u00a083(2), 121\u2013139 (1989)","journal-title":"Information and Computation"},{"key":"43_CR4","unstructured":"Kamp, J.A.W.: Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Berkeley (1968)"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Kouck\u00fd, M., Pudl\u00e1k, P., Th\u00e9rien, D.: Bounded-depth circuits: separating wires from gates. In: Symposium on Theory of Computing (STOC 2005), 2005","DOI":"10.1145\/1060590.1060629"},{"key":"43_CR6","volume-title":"Counter-Free Automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)"},{"key":"43_CR7","first-page":"679","volume-title":"Handbook of language theory, ch. 10","author":"J.-E. Pin","year":"1997","unstructured":"Pin, J.-E.: Syntactic semigroups. In: Rozenberg, G. (ed.) Handbook of language theory, ch. 10, vol.\u00a01, pp. 679\u2013746. Springer, Heidelberg (1997)"},{"issue":"2","key":"43_CR8","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(2), 190\u2013194 (1965)","journal-title":"Information and Control"},{"key":"43_CR9","doi-asserted-by":"crossref","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. Birkhauser, Boston (1994)"},{"key":"43_CR10","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 the logical description of regular languages. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, p. 528. Springer, Heidelberg (2002)"},{"key":"43_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-45995-2_13","volume-title":"LATIN 2002: Theoretical Informatics","author":"H. Straubing","year":"2002","unstructured":"Straubing, H., Th\u00e9rien, D.: Weakly iterated block products of finite monoids. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, p. 91. Springer, Heidelberg (2002)"},{"issue":"1","key":"43_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s00224-002-1035-9","volume":"36","author":"H. Straubing","year":"2003","unstructured":"Straubing, H., Th\u00e9rien, D.: Regular languages defined by generalized first-order formulas with a bounded number of bound variables. Theory of Computing Systems\u00a036(1), 29\u201369 (2003)","journal-title":"Theory of Computing Systems"},{"key":"43_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/inco.1995.1067","volume":"118","author":"H. Straubing","year":"1995","unstructured":"Straubing, H., Th\u00e9rien, D., Thomas, W.: Regular languages defined by generalized quantifiers. Information and Computation\u00a0118, 289\u2013301 (1995)","journal-title":"Information and Computation"},{"key":"43_CR14","unstructured":"Tesson, P.: Computational Complexity Questions Related to Finite Monoids and Semigroups. PhD thesis, McGill University (2003)"},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"Tesson, P., Th\u00e9rien, D.: Complete classifications for the communication complexity of regular languages. Theory of Comput. Syst. (2004) (to appear)","DOI":"10.1007\/3-540-36494-3_7"},{"key":"43_CR16","doi-asserted-by":"crossref","unstructured":"Th\u00e9rien, D., Wilke, T.: Over words, two variables are as powerful as one quantifier alternation. In: Proc. 30th ACM Symposium on the Theory of Computing, pp. 256\u2013263 (1998)","DOI":"10.1145\/276698.276749"},{"issue":"1","key":"43_CR17","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00224-003-1109-3","volume":"37","author":"D. Th\u00e9rien","year":"2004","unstructured":"Th\u00e9rien, D., Wilke, T.: Nesting until and since in linear temporal logic. Theory Comput. Syst.\u00a037(1), 111\u2013131 (2004)","journal-title":"Theory Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:09Z","timestamp":1605643569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11523468_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}