{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:07:35Z","timestamp":1648908455875},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":7686,"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":[[1992,7]]},"DOI":"10.1016\/0304-3975(92)90152-6","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T21:44:32Z","timestamp":1034286272000},"page":"133-141","source":"Crossref","is-referenced-by-count":2,"title":["Formulas, regular languages and boolean circuits"],"prefix":"10.1016","volume":"101","author":[{"given":"Pierre","family":"P\u00e9ladeau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90152-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\/0304-3975(92)90152-6_BIB2","doi-asserted-by":"crossref","unstructured":"D.A.M. Barrington, K. Compton, H. Straubing and D. Th\u00e9rien, Regular languages in NC1, J. Comp. Sys. Sci. (to appear).","DOI":"10.1016\/0022-0000(92)90014-A"},{"key":"10.1016\/0304-3975(92)90152-6_BIB3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0890-5401(90)90007-5","article-title":"Nonuniform automata over groups","volume":"89","author":"Barrington","year":"1990","journal-title":"Inform. and Comput."},{"issue":"4","key":"10.1016\/0304-3975(92)90152-6_BIB4","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. ACM"},{"key":"10.1016\/0304-3975(92)90152-6_BIB5","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","article-title":"Weak second-order arithmetic and finite automata","volume":"6","author":"B\u00fcchi","year":"1960","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"10.1016\/0304-3975(92)90152-6_BIB6","volume":"Vol. B","author":"Eilenberg","year":"1976"},{"key":"10.1016\/0304-3975(92)90152-6_BIB7","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":"J. Math. Systems Theory"},{"key":"10.1016\/0304-3975(92)90152-6_BIB8","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","article-title":"Semigroups, Presburger formulas, and languages","volume":"16","author":"Ginsburg","year":"1966","journal-title":"Pacific J. Math"},{"key":"10.1016\/0304-3975(92)90152-6_BIB9","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0019-9958(84)80062-5","article-title":"A logic for constant-depth circuits","volume":"61","author":"Gurevich","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(92)90152-6_BIB10_1","first-page":"347","article-title":"Languages that capture complexity classes","author":"Immerman","year":"1983","journal-title":"Proc. 15th ACM STOC"},{"key":"10.1016\/0304-3975(92)90152-6_BIB10_2","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0216051","article-title":"Languages that capture complexity classes","volume":"16","author":"Immerman","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90152-6_BIB11","series-title":"Automata Studies","first-page":"3","article-title":"Representation of events in nerve nets and finite automata","author":"Kleene","year":"1954"},{"key":"10.1016\/0304-3975(92)90152-6_BIB12","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01786976","article-title":"Complexity classes and theories of finite models","volume":"15","author":"Lynch","year":"1982","journal-title":"Math. System Theory"},{"key":"10.1016\/0304-3975(92)90152-6_BIB13","series-title":"Proc. 16th ICALP","first-page":"589","article-title":"Automata theory meets complexity theory","volume":"Vol. 372","author":"McKenzie","year":"1989"},{"key":"10.1016\/0304-3975(92)90152-6_BIB14","series-title":"Counter-free Automata","author":"McNaughton","year":"1971"},{"key":"10.1016\/0304-3975(92)90152-6_BIB15","article-title":"Classes of boolean circuits and varieties of finite monoids","volume":"6","author":"P\u00e9ladeau","year":"1989"},{"key":"10.1016\/0304-3975(92)90152-6_BIB16_1","first-page":"397","article-title":"Logically defined subsets of Nk","volume":"Vol. 379","author":"P\u00e9ladeau","year":"1989"},{"key":"10.1016\/0304-3975(92)90152-6_BIB16_2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(92)90328-D","article-title":"Logically defined subsets of Nk","volume":"93","author":"P\u00e9ladeau","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90152-6_BIB17","article-title":"Classes de circuits bool\u00e9ens et vari\u00e9t\u00e9s de mono\u00efdes","volume":"6","author":"P\u00e9ladeau","year":"1990"},{"key":"10.1016\/0304-3975(92)90152-6_BIB18_1","series-title":"Vari\u00e9t\u00e9s de langages formels","author":"Pin","year":"1984"},{"key":"10.1016\/0304-3975(92)90152-6_BIB18_2","series-title":"Varieties of Formal Languages","author":"Pin","year":"1986"},{"key":"10.1016\/0304-3975(92)90152-6_BIB19","first-page":"61","article-title":"Borel sets and circuit complexity","author":"Sipser","year":"1983","journal-title":"Proc. 15th ACM Symp. on the Theory of Computing"},{"key":"10.1016\/0304-3975(92)90152-6_BIB20","series-title":"Proc. 15th ICALP","first-page":"561","article-title":"Regular languages defined with generalized quantifiers","volume":"Vol. 317","author":"Straubing","year":"1988"},{"key":"10.1016\/0304-3975(92)90152-6_BIB21","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/0022-0000(82)90016-2","article-title":"Classifying regular events in symbolic logic","volume":"25","author":"Thomas","year":"1982","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592901526?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592901526?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T22:21:25Z","timestamp":1555194085000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592901526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["0304397592901526"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90152-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}