{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T01:48:54Z","timestamp":1705110534542},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,8,1]],"date-time":"1986-08-01T00:00:00Z","timestamp":523238400000},"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":9847,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1986,8]]},"DOI":"10.1016\/0022-0000(86)90045-0","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"88-105","source":"Crossref","is-referenced-by-count":34,"title":["A lower bound for probabilistic algorithms for finite state machines"],"prefix":"10.1016","volume":"33","author":[{"given":"Albert G.","family":"Greenberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Weiss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 1","key":"10.1016\/0022-0000(86)90045-0_BIB1","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1214\/aop\/1176993392","article-title":"Correlated random walks","volume":"12","author":"Bender","year":"1984","journal-title":"Ann. Probab."},{"key":"10.1016\/0022-0000(86)90045-0_BIB2","series-title":"Proceedings, Int. Sympos. Math. Found. of Comput. Sci.","article-title":"Probabilistic two-way machines","volume":"Vol. 118","author":"Freivalds","year":"1981"},{"key":"10.1016\/0022-0000(86)90045-0_BIB3","series-title":"Rational Quadratic Forms","author":"Cassels","year":"1978"},{"key":"10.1016\/0022-0000(86)90045-0_BIB4","series-title":"Matrix Polynomials","author":"Gohberg","year":"1982"},{"key":"10.1016\/0022-0000(86)90045-0_BIB5","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0022-0000(86)90045-0_BIB6","series-title":"Proceedings, 25th Annu. IEEE, Sympos. Found. of Comput. Sci.","first-page":"320","article-title":"A lower bound for probabilistic algorithms for finite state machines","author":"Greenberg","year":"1984"},{"key":"10.1016\/0022-0000(86)90045-0_BIB7","series-title":"Finite Markov Chains","author":"Kemeny","year":"1960"},{"key":"10.1016\/0022-0000(86)90045-0_BIB8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF00535173","article-title":"Random walks with internal degrees of freedom","volume":"68","author":"Kr\u00e1mli","year":"1984","journal-title":"Z. Wahrsch. Verw. Gebiete"},{"issue":"No. 1","key":"10.1016\/0022-0000(86)90045-0_BIB9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0213010","article-title":"Alternating pushdown and stack automata","volume":"13","author":"Ladner","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(86)90045-0_BIB10","article-title":"The Markov Chain Tree Theorem","author":"Leighton","year":"1983"},{"key":"10.1016\/0022-0000(86)90045-0_BIB11","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1093\/biomet\/42.3-4.486","article-title":"The gambler's ruin problem with correlation","volume":"42","author":"Mohan","year":"1953","journal-title":"Biometrika"},{"key":"10.1016\/0022-0000(86)90045-0_BIB12","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","article-title":"Probabilistic automata","volume":"6","author":"Rabin","year":"1963","journal-title":"Inform. Control"},{"key":"10.1016\/0022-0000(86)90045-0_BIB13","series-title":"Discrete Markov Chains","author":"Romanovskii","year":"1970"},{"key":"10.1016\/0022-0000(86)90045-0_BIB14","series-title":"Automata-theoretic Aspects of Formal Power Series","author":"Salomaa","year":"1978"},{"key":"10.1016\/0022-0000(86)90045-0_BIB15","series-title":"Non-negative Matrices and Markov Chains","author":"Seneta","year":"1981"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000086900450?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000086900450?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:52:49Z","timestamp":1550325169000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000086900450"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,8]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,8]]}},"alternative-id":["0022000086900450"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(86)90045-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1986,8]]}}}