{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:35:45Z","timestamp":1725471345064},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540454588"},{"type":"electronic","value":"9783540454595"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11874683_28","type":"book-chapter","created":{"date-parts":[[2006,9,27]],"date-time":"2006-09-27T13:47:26Z","timestamp":1159364846000},"page":"426-440","source":"Crossref","is-referenced-by-count":3,"title":["An Algebraic Point of View on the Crane Beach Property"],"prefix":"10.1007","author":[{"given":"Clemens","family":"Lautemann","sequence":"first","affiliation":[]},{"given":"Pascal","family":"Tesson","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Th\u00e9rien","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"D.A. Barrington","year":"1989","unstructured":"Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1. J.\u00a0Comput. Syst. Sci.\u00a038(1), 150\u2013164 (1989)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"issue":"2","key":"28_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.jcss.2004.07.004","volume":"70","author":"D.A.M. Barrington","year":"2005","unstructured":"Barrington, D.A.M., Immerman, N., Lautemann, C., Schweikardt, N., Th\u00e9rien, D.: First-order expressibility of languages with neutral letters or: The Crane Beach conjecture. J. Comput. Syst. Sci.\u00a070(2), 101\u2013127 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"28_CR3","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"D.A.M. Barrington","year":"1990","unstructured":"Barrington, D.A.M., Immerman, N., Straubing, H.: On uniformity within NC1. J. Comput. Syst. Sci.\u00a041(3), 274\u2013306 (1990)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"28_CR4","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1006\/jcss.1995.1029","volume":"50","author":"D.A.M. Barrington","year":"1995","unstructured":"Barrington, D.A.M., Straubing, H.: Superlinear lower bounds for bounded-width branching programs. J.\u00a0Comput. Syst. Sci.\u00a050(3), 374\u2013381 (1995)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"issue":"2","key":"28_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0890-5401(90)90007-5","volume":"89","author":"D.A.M. Barrington","year":"1990","unstructured":"Barrington, D.A.M., Straubing, H., Th\u00e9rien, D.: Non-uniform automata over groups. Information and Computation\u00a089(2), 109\u2013132 (1990)","journal-title":"Information and Computation"},{"issue":"4","key":"28_CR6","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1145\/48014.63138","volume":"35","author":"D.A.M. Barrington","year":"1988","unstructured":"Barrington, D.A.M., Th\u00e9rien, D.: Finite monoids and the fine structure of NC 1. Journal of the ACM\u00a035(4), 941\u2013952 (1988)","journal-title":"Journal of the ACM"},{"key":"28_CR7","unstructured":"Behle, C., Lange, K.-J.: FO-uniformity. In: Proc.\u00a021st Conf.\u00a0 on Computational Complexity (CCC 2006) (2006)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Libkin, L.: Expressive power: The finite case. In: Constraint Databases, pp. 55\u201387 (2000)","DOI":"10.1007\/978-3-662-04031-7_3"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Furst, M.L., Lipton, R.J.: Multi-party protocols. In: Proc.\u00a0 15th ACM Symp.\u00a0on Theory of Computing (STOC 1983), pp. 94\u201399 (1983)","DOI":"10.1145\/800061.808737"},{"key":"28_CR10","unstructured":"Chattopadhyay, A., Krebs, A., Kouck\u00fd, M., Szegedy, M., Tesson, P., Th\u00e9rien, D.: Functions with bounded multiparty communication complexity (submitted, 2006)"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36494-3_30","volume-title":"STACS 2003","author":"R. Gavald\u00e0","year":"2003","unstructured":"Gavald\u00e0, R., Th\u00e9rien, D.: Algebraic characterizations of small classes of boolean functions. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607. Springer, Heidelberg (2003)"},{"issue":"1","key":"28_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0019-9958(84)80062-5","volume":"61","author":"Y. Gurevich","year":"1984","unstructured":"Gurevich, Y., Lewis, H.: A logic for constant-depth circuits. Information and Control\u00a061(1), 65\u201374 (1984)","journal-title":"Information and Control"},{"issue":"4","key":"28_CR13","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1137\/0216051","volume":"16","author":"N. Immerman","year":"1987","unstructured":"Immerman, N.: Languages that capture complexity classes. SIAM J. Comput.\u00a016(4), 760\u2013778 (1987)","journal-title":"SIAM J. Comput."},{"key":"28_CR14","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"28_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L. Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/BF01212963","volume":"1","author":"P. McKenzie","year":"1991","unstructured":"McKenzie, P., P\u00e9ladeau, P., Th\u00e9rien, D.: NC1: The automata theoretic viewpoint. Computational Complexity\u00a01, 330\u2013359 (1991)","journal-title":"Computational Complexity"},{"issue":"1","key":"28_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0304-3975(92)90152-6","volume":"101","author":"P. P\u00e9ladeau","year":"1992","unstructured":"P\u00e9ladeau, P.: Formulas, regular languages and boolean circuits. Theor. Comput. Sci.\u00a0101(1), 133\u2013141 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR18","first-page":"679","volume-title":"Handbook of language theory","author":"J.-E. Pin","year":"1997","unstructured":"Pin, J.-E.: Syntactic semigroups. In: Handbook of language theory, vol.\u00a01, ch.10, pp. 679\u2013746. Springer, Heidelberg (1997)"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BFb0055038","volume-title":"Automata, Languages and Programming","author":"J.-F. Raymond","year":"1998","unstructured":"Raymond, J.-F., Tesson, P., Th\u00e9rien, D.: An algebraic approach to communication complexity. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 29\u201340. Springer, Heidelberg (1998)"},{"key":"28_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/11672142_40","volume-title":"STACS 2006","author":"A. Roy","year":"2006","unstructured":"Roy, A., Straubing, H.: Definability of languages by generalized first-order formulas over (N, +). In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 489\u2013499. Springer, Heidelberg (2006)"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Smolensky, R.: Algebraic methods in the theory of lower bounds for boolean circuit complexity. In: Proc. 19 th ACM STOC, pp. 77\u201382 (1986)","DOI":"10.1145\/28395.28404"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Straubing, H.: Finite Automata, Formal Logic and Circuit Complexity. Boston, Birkhauser (1994)","DOI":"10.1007\/978-1-4612-0289-9"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Straubing, H.: When can one monoid simulate another? In: Algorithmic Problems in Groups and Semigroups, pp. 267\u2013288. Birkh\u00e4user (2000)","DOI":"10.1007\/978-1-4612-1388-8_15"},{"key":"28_CR24","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/inco.2000.2923","volume":"166","author":"H. Straubing","year":"2001","unstructured":"Straubing, H.: Languages defined by modular quantifiers. Information and Computation\u00a0166, 112\u2013132 (2001)","journal-title":"Information and Computation"},{"key":"28_CR25","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":"28_CR26","unstructured":"Tesson, P.: Computational Complexity Questions Related to Finite Monoids and Semigroups. PhD thesis, McGill University (2003)"},{"issue":"2","key":"28_CR27","first-page":"247","volume":"7","author":"P. Tesson","year":"2002","unstructured":"Tesson, P., Th\u00e9rien, D.: The computing power of programs over finite monoids. Journal of Automata, Languages and Combinatorics\u00a07(2), 247\u2013258 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"28_CR28","doi-asserted-by":"crossref","unstructured":"Tesson, P., Th\u00e9rien, D.: Diamonds are forever: the variety DA. In: Semigroups, Algorithms, Automata and Languages. WSP (2002)","DOI":"10.1142\/9789812776884_0021"},{"issue":"2","key":"28_CR29","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s00224-004-1190-2","volume":"38","author":"P. Tesson","year":"2005","unstructured":"Tesson, P., Th\u00e9rien, D.: Complete classifications for the communication complexity of regular languages. Theory of Computing Systems\u00a038(2), 135\u2013159 (2005)","journal-title":"Theory of Computing Systems"},{"key":"28_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/11523468_43","volume-title":"Automata, Languages and Programming","author":"P. Tesson","year":"2005","unstructured":"Tesson, P., Th\u00e9rien, D.: Restricted two-variable sentences, circuits and communication complexity. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 526\u2013538. Springer, Heidelberg (2005)"},{"key":"28_CR31","first-page":"37","volume":"88","author":"P. Tesson","year":"2006","unstructured":"Tesson, P., Th\u00e9rien, D.: Bridges between algebraic automata theory and complexity theory. The Complexity Column, Bull.\u00a0EATCS\u00a088, 37\u201364 (2006)","journal-title":"The Complexity Column, Bull.\u00a0EATCS"},{"key":"28_CR32","doi-asserted-by":"crossref","unstructured":"Tesson, P., Th\u00e9rien, D.: Logic meets algebra: the case of regular languages (submitted, 2006)","DOI":"10.2168\/LMCS-3(1:4)2007"},{"key":"28_CR33","first-page":"389","volume-title":"Languages, Automata and Logic","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, Automata and Logic, vol.\u00a0III, ch. 7, pp. 389\u2013455. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11874683_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:47:34Z","timestamp":1605642454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11874683_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540454588","9783540454595"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/11874683_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}