{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T05:25:31Z","timestamp":1774589131507,"version":"3.50.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":8264,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0890-5401(90)90007-5","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"109-132","source":"Crossref","is-referenced-by-count":77,"title":["Non-uniform automata over groups"],"prefix":"10.1016","volume":"89","author":[{"given":"David A.","family":"Mix Barrington","sequence":"first","affiliation":[]},{"given":"Howard","family":"Straubing","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Th\u00e9rien","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(90)90007-5_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\/0890-5401(90)90007-5_BIB2","author":"Barrington","year":"1985"},{"key":"10.1016\/0890-5401(90)90007-5_BIB3","article-title":"Bounded-Width Branching Programs","author":"Barrington","year":"1986"},{"key":"10.1016\/0890-5401(90)90007-5_BIB4","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. System Sci."},{"key":"10.1016\/0890-5401(90)90007-5_BIB5","series-title":"Automata, Languages, and Programming: 14th International Colloquium","first-page":"163","article-title":"Non-uniform automata over groups","author":"Barrington","year":"1987"},{"issue":"No. 4","key":"10.1016\/0890-5401(90)90007-5_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. Math."},{"key":"10.1016\/0890-5401(90)90007-5_BIB7","series-title":"Proceedings 15th Ann. ACM Symposium on the Theory of Computing","first-page":"87","article-title":"Bounds for width two branching programs","author":"Borodin","year":"1983"},{"key":"10.1016\/0890-5401(90)90007-5_BIB8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0022-0000(78)90049-1","article-title":"The dot-depth hierarchy of star-free languages is infinite","volume":"16","author":"Brzozowski","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(90)90007-5_BIB9","series-title":"Proceedings 15th Ann. ACM Symposium on the Theory of Computing","first-page":"52","article-title":"Unbounded fan-in circuits and associative functions","author":"Chandra","year":"1983"},{"key":"10.1016\/0890-5401(90)90007-5_BIB10","series-title":"Proceedings 15th Ann. ACM Symposium on the Theory of Computing","first-page":"94","article-title":"Multi-party protocols","author":"Chandra","year":"1983"},{"key":"10.1016\/0890-5401(90)90007-5_BIB11","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","article-title":"Constant-depth reducibility","volume":"13","author":"Chandra","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(90)90007-5_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(71)80003-X","article-title":"Dot-depth of star-free events","volume":"5","author":"Cohen","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(90)90007-5_BIB13","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"The taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(90)90007-5_BIB14","volume":"Vol. B","author":"Eilenberg","year":"1976"},{"key":"10.1016\/0890-5401(90)90007-5_BIB15","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(85)90045-3","article-title":"Bounded depth, polynomial-size circuits for symmetric functions","volume":"36","author":"Fagin","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90007-5_BIB16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","article-title":"Parity, circuits, and the polynomial-time hierarchy","volume":"18","author":"Furst","year":"1984","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0890-5401(90)90007-5_BIB17","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0196-6774(86)90011-8","article-title":"The NP-completeness column: An ongoing guide","volume":"7","author":"Johnson","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0890-5401(90)90007-5_BIB18","article-title":"The Algebraic Theory of Machines, Languages, and Semigroups","author":"Krohn","year":"1968"},{"key":"10.1016\/0890-5401(90)90007-5_BIB19","author":"Lallement","year":"1979"},{"issue":"No. 2","key":"10.1016\/0890-5401(90)90007-5_BIB20","first-page":"93","article-title":"Sur les langages reconnus par des groupes nilpotents","volume":"306","author":"P\u00e9ladeau","year":"1988","journal-title":"C. R. Acad. Sci. Paris Ser. I Math."},{"key":"10.1016\/0890-5401(90)90007-5_BIB21","author":"Pin","year":"1986"},{"key":"10.1016\/0890-5401(90)90007-5_BIB22","series-title":"Proceedings 20th Ann. IEEE Symposium on Foundations of Computer Science","first-page":"307","article-title":"On simultaneous resource bounds (preliminary version)","author":"Pippenger","year":"1979"},{"issue":"No. 4","key":"10.1016\/0890-5401(90)90007-5_BIB23","first-page":"333","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\/0890-5401(90)90007-5_BIB24","author":"Savage","year":"1976"},{"key":"10.1016\/0890-5401(90)90007-5_BIB25","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","article-title":"On finite monoids having only trivial subgroups","volume":"8","author":"Sch\u00fctzenberger","year":"1965","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(90)90007-5_BIB26","series-title":"Proceedings, 15th ACM Symposium on the Theory of Computing","first-page":"61","article-title":"Borel sets and circuit complexity","author":"Sipser","year":"1983"},{"key":"10.1016\/0890-5401(90)90007-5_BIB27","series-title":"Proceedings, 19th ACM Symposium on the 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\/0890-5401(90)90007-5_BIB28","series-title":"Proceedings, 4th Hawaii Symposium on System Sciences","first-page":"525","article-title":"On time-hardware complexity tradeoffs for boolean functions","author":"Spira","year":"1971"},{"key":"10.1016\/0890-5401(90)90007-5_BIB29","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0022-4049(79)90024-0","article-title":"Families of recognizable sets corresponding to certain varieties of finite monoids","volume":"15","author":"Straubing","year":"1979","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/0890-5401(90)90007-5_BIB30","series-title":"Automata, Languages, and Programming: 13th International Colloquium","first-page":"416","article-title":"Semigroups and languages of dot-depth 2","volume":"Vol. 226","author":"Straubing","year":"1986"},{"key":"10.1016\/0890-5401(90)90007-5_BIB31","series-title":"Formal Properties of Finite Automata and Applications: LITP Spring School on Theoretical Computer Science","first-page":"199","article-title":"Finite automata and computational complexity","volume":"Vol. 386","author":"Straubing","year":"1988"},{"key":"10.1016\/0890-5401(90)90007-5_BIB32","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0304-3975(81)90057-8","article-title":"Classification of finite monoids: The language approach","volume":"14","author":"Th\u00e9rien","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90007-5_BIB33","series-title":"Combinatorics on Words: Progress and Perspectives","first-page":"297","article-title":"Subword counting and nilpotent groups","author":"Th\u00e9rien","year":"1983"},{"key":"10.1016\/0890-5401(90)90007-5_BIB34","author":"Zassenhaus","year":"1958"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540190900075?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540190900075?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T18:25:44Z","timestamp":1549045544000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540190900075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["0890540190900075"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(90)90007-5","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}