{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:45:37Z","timestamp":1725551137035},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540006237"},{"type":"electronic","value":"9783540364948"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36494-3_7","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T17:12:04Z","timestamp":1269882724000},"page":"62-73","source":"Crossref","is-referenced-by-count":5,"title":["Complete Classifications for the Communication Complexity of Regular Languages"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Tesson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Th\u00e9rien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,17]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"L. Babai, P. Frankl, and J. Simon. Complexity classes in communication complexity theory. In Proc. 27th IEEE FOCS, pages 337\u2013347, 1986.","DOI":"10.1109\/SFCS.1986.15"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"D. A. Barrington","year":"1989","unstructured":"D. A. Barrington. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci., 38(1):150\u2013164, Feb. 1989.","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1145\/48014.63138","volume":"35","author":"D. A. M. Barrington","year":"1988","unstructured":"D. A. M. Barrington and D. Th\u00e9rien. Finite monoids and the fine structure of NC1. Journal of the ACM, 35(4):941\u2013952, Oct. 1988.","journal-title":"Journal of the ACM"},{"key":"7_CR4","unstructured":"C. Damm,, M. K. C. Meinel, and S. Waack. On relations between counting communication complexity classes. To appear in Journal of Computer and Systems Sciences. Currently available e.g. from http:\/\/www.num.math.uni-goettingen.de\/damm\/ and preliminary version in proceedings of STACS\u201992."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511574948"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"J.-E. Pin. Varieties of formal languages. North Oxford Academic Publishers Ltd, London, 1986.","DOI":"10.1007\/978-1-4613-2215-3"},{"key":"7_CR7","unstructured":"P. Pudl\u00e1k. An application of Hindman\u2019s theorem to a problem on communication complexity. Draft, 2002."},{"key":"7_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BFb0055038","volume-title":"An algebraic approach to communication complexity","author":"J.-F. Raymond","year":"1998","unstructured":"J.-F. Raymond, P. Tesson, and D. Th\u00e9rien. An algebraic approach to communication complexity. Lecture Notes in Computer Science (ICALP\u201998), 1443:29\u201340, 1998."},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/0022-0000(93)90039-Y","volume":"47","author":"M. Szegedy","year":"1993","unstructured":"M. Szegedy. Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC. J. Comput. Syst. Sci., 47(3):405\u2013423, 1993.","journal-title":"ACC. J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","STACS 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36494-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T15:03:27Z","timestamp":1558969407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36494-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540006237","9783540364948"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-36494-3_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}