{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:08:51Z","timestamp":1709813331107},"reference-count":16,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"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":[[1992,10]]},"DOI":"10.1016\/0020-0190(92)90119-g","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"321-326","source":"Crossref","is-referenced-by-count":10,"title":["A note on two-way probabilistic automata"],"prefix":"10.1016","volume":"43","author":[{"given":"Jie","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90119-G_BIB1","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0097-3165(78)90067-5","article-title":"Matrix tree theorems","volume":"24","author":"Chaiken","year":"1978","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0020-0190(92)90119-G_BIB2","series-title":"Research Rept. RJ6262","article-title":"Interactive proof systems with finite state verifiers","author":"Dwork","year":"1988"},{"key":"10.1016\/0020-0190(92)90119-G_BIB3","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1137\/0219069","article-title":"A time complexity gap for 2-way probabilistic finite state automata","volume":"19","author":"Dwork","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90119-G_BIB4","first-page":"33","article-title":"Probabilistic two-way machines","volume":"118","author":"Freivalds","year":"1981"},{"key":"10.1016\/0020-0190(92)90119-G_BIB5","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0022-0000(86)90045-0","article-title":"A lower bound for probabilistic algorithms for finite state machines","volume":"33","author":"Greenberg","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(92)90119-G_BIB6","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0020-0190(92)90119-G_BIB7","series-title":"Markov Chains Theory and Applications","author":"Isaacson","year":"1976"},{"key":"10.1016\/0020-0190(92)90119-G_BIB8","first-page":"35","article-title":"Two-way probabilistic automata","volume":"5","author":"Kuklin","year":"1973","journal-title":"Avtomat. i Vycis. Tekhn."},{"key":"10.1016\/0020-0190(92)90119-G_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\/0020-0190(92)90119-G_BIB10","article-title":"The Markov chain tree theorem","author":"Leighton","year":"1983","journal-title":"MIT Tech. Memo. 249"},{"key":"10.1016\/0020-0190(92)90119-G_BIB11","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/TIT.1986.1057250","article-title":"Estimating a probability using finite memory","volume":"6","author":"Leighton","year":"1986","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0020-0190(92)90119-G_BIB12","series-title":"Proc. Sixth Ann. IEEE Symp. on Switching Circuit Theory and Logical Design","first-page":"191","article-title":"Memory bounds for recognition of context-free and context-sensitive languages","author":"Lewis","year":"1965"},{"key":"10.1016\/0020-0190(92)90119-G_BIB13","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. and Control"},{"key":"10.1016\/0020-0190(92)90119-G_BIB14","series-title":"Abstract Automata","author":"Starke","year":"1972"},{"key":"10.1016\/0020-0190(92)90119-G_BIB15","article-title":"On probabilistic automata and their generalizations","volume":"429","author":"Turakainen","year":"1968","journal-title":"Ann. Acad. Sci. Fenn. Ser. A I"},{"key":"10.1016\/0020-0190(92)90119-G_BIB16","series-title":"Structural Complexity I","author":"Balcazar","year":"1988"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290119G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290119G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:28:38Z","timestamp":1555129718000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290119G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["002001909290119G"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90119-g","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}