{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:47:35Z","timestamp":1709826455625},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5890,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/s0304-3975(96)00297-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"325-339","source":"Crossref","is-referenced-by-count":7,"title":["Finite semigroup varieties defined by programs"],"prefix":"10.1016","volume":"180","author":[{"given":"Pierre","family":"P\u00e9ladeau","sequence":"first","affiliation":[]},{"given":"Howard","family":"Straubing","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Therien","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00297-6_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","article-title":"\u03a311 formulae on finite structures","volume":"24","author":"Ajtai","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(96)00297-6_BIB2","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","article-title":"Bounded-width polynomial-size branching programs recognize exactly those languages in NC1","volume":"38","author":"Barrington","year":"1989","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/S0304-3975(96)00297-6_BIB3","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/0022-0000(92)90014-A","article-title":"Regular languages in NC1","volume":"44","author":"Barrington","year":"1992","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/S0304-3975(96)00297-6_BIB4","series-title":"Proc. 6th IEEE Conf. on Structure in Complexity Theory","first-page":"305","article-title":"Superlinear lower bounds for bounded-width branching programs","author":"Barrington","year":"1991"},{"key":"10.1016\/S0304-3975(96)00297-6_BIB5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0890-5401(90)90007-5","article-title":"Non-uniform automata over groups","volume":"89","author":"Barrington","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(96)00297-6_BIB6","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1145\/48014.63138","article-title":"Finite monoids and the fine structure of NC1","volume":"35","author":"Barrington","year":"1988","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(96)00297-6_BIB7_1","volume":"vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/S0304-3975(96)00297-6_BIB7_2","volume":"vol. B","author":"Eilenberg","year":"1976"},{"key":"10.1016\/S0304-3975(96)00297-6_BIB8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","article-title":"Parity, circuits and the polynomial-time hierarchy","volume":"17","author":"Furst","year":"1984","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(96)00297-6_BIB9","series-title":"Proc. 33rd IEEE Ann. Symp. Foundations of Computer Science","first-page":"278","article-title":"Separating the communication complexity of mod p and mod m circuits","author":"Grolmusz","year":"1992"},{"key":"10.1016\/S0304-3975(96)00297-6_BIB10","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/BF01212963","article-title":"NC1: the automata-theoretic viewpoint","volume":"1","author":"McKenzie","year":"1991","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0304-3975(96)00297-6_BIB11","article-title":"Classes de circuits bool\u00e9ens et vari\u00e9t\u00e9s de mono\u00efdes","author":"P\u00e9ladeau","year":"1990"},{"key":"10.1016\/S0304-3975(96)00297-6_BIB12","series-title":"Varieties of Formal Languages","author":"Pin","year":"1986"},{"key":"10.1016\/S0304-3975(96)00297-6_BIB13_1","first-page":"598","article-title":"Lower bounds for the size of circuits of bounded depth with basis &, \u2295","volume":"41","author":"Razborov","year":"1987","journal-title":"Math. Zametki"},{"key":"10.1016\/S0304-3975(96)00297-6_BIB13_2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF01137685","volume":"41","author":"Razborov","year":"1987","journal-title":"Math. Notes Academy Sci. USSR"},{"key":"10.1016\/S0304-3975(96)00297-6_BIB14","series-title":"Proc. 19th Ann. ACM Symp. Theory of Computing","first-page":"77","article-title":"Algebraic methods in the theory of lower bounds for boolean circuit complexity","author":"Smolensky","year":"1987"},{"key":"10.1016\/S0304-3975(96)00297-6_BIB15","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0022-4049(85)90062-3","article-title":"Finite semigroup varieties of the form V \u2217 D","volume":"36","author":"Straubing","year":"1985","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/S0304-3975(96)00297-6_BIB16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1142\/S0218196791000043","article-title":"Constant-depth periodic circuits","volume":"1","author":"Straubing","year":"1991","journal-title":"Internat. J. Algebra Comput."},{"key":"10.1016\/S0304-3975(96)00297-6_BIB17","series-title":"Proc. 22nd Ann. ACM Symp. Theory of Computing","first-page":"278","article-title":"Functions with bounded symmetric communication complexity and circuits with MOD m gates","author":"Szegedy","year":"1990"},{"key":"10.1016\/S0304-3975(96)00297-6_BIB18","series-title":"Proc. 31st IEEE Ann. Symp. Foundations of Computer Science","first-page":"619","article-title":"On ACC and threshold circuits","author":"Yao","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002976?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002976?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:58:18Z","timestamp":1555419498000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002976"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0304397596002976"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00297-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}