{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T16:12:28Z","timestamp":1648570348945},"reference-count":6,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1016\/s0020-0190(99)00162-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:19:59Z","timestamp":1027617599000},"page":"23-28","source":"Crossref","is-referenced-by-count":1,"title":["An ergodic theorem for read-once non-uniform deterministic finite automata"],"prefix":"10.1016","volume":"73","author":[{"given":"Mikael","family":"Goldmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Russell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Th\u00e9rien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(99)00162-3_ID007","series-title":"Bounded-width branching programs","author":"Barrington","year":"1986"},{"issue":"3","key":"10.1016\/S0020-0190(99)00162-3_ID008","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1006\/jcss.1995.1029","article-title":"Superlinear lower bounds for bounded-width branching programs","volume":"Vol. 50","author":"Barrington","year":"1995","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/S0020-0190(99)00162-3_ID009","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1145\/48014.63138","article-title":"Finite monoids and the fine structure of NC^1","volume":"Vol. 35","author":"Barrington","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(99)00162-3_ID010","series-title":"Group Representations in Probability and Statistics","author":"Diaconis","year":"1988"},{"key":"10.1016\/S0020-0190(99)00162-3_ID011","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00535487","article-title":"Generating a random permutation with random transpositions","volume":"Vol. 57","author":"Diaconis","year":"1981","journal-title":"Z. Wahrscheinlichkeitstheorie Verw. Gebiete"},{"issue":"2","key":"10.1016\/S0020-0190(99)00162-3_ID012","first-page":"93","article-title":"Sur les langages reconnus par des groupes nilpotents","volume":"Vol. 306","author":"P\u00e9ladeau","year":"1988","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. I Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099001623?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099001623?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T02:21:41Z","timestamp":1556158901000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019099001623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":6,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0020019099001623"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(99)00162-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}