{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:34:09Z","timestamp":1758274449968},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":[[1995,1]]},"DOI":"10.1016\/0020-0190(94)00169-y","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:04:31Z","timestamp":1027649071000},"page":"27-31","source":"Crossref","is-referenced-by-count":2,"title":["The reachability problem for finite cellular automata"],"prefix":"10.1016","volume":"53","author":[{"given":"Andrea","family":"Clementi","sequence":"first","affiliation":[]},{"given":"Russell","family":"Impagliazzo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00169-Y_BIB1","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","article-title":"Arthur-Merlin games: a randomized proof system and a hierarchy of complexity classes","volume":"36","author":"Babai","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(94)00169-Y_BIB2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","article-title":"Does co-NP have short interactive proofs?","volume":"25","author":"Boppana","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)00169-Y_BIB3","series-title":"Proc. 31st IEEE Symp. on Foundations of Computer Science","first-page":"788","article-title":"On the predictability of coupled automata: An allegory about chaos","author":"Buss","year":"1990"},{"key":"10.1016\/0020-0190(94)00169-Y_BIB4","article-title":"On the complexity of cellular automata","author":"Clementi","year":"1994"},{"key":"10.1016\/0020-0190(94)00169-Y_BIB5","series-title":"Proc. 2nd Italian Conf. on Algorithms and Complexity","first-page":"73","article-title":"Graph theory and interactive protocols for reachability problems on finite cellular automata","volume":"778","author":"Clementi","year":"1994"},{"key":"10.1016\/0020-0190(94)00169-Y_BIB6","unstructured":"K. Culik II and S. Yu, Undecidability of CA classification scheme, Complex Systems2, pp. 177\u2013190."},{"key":"10.1016\/0020-0190(94)00169-Y_BIB7","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","article-title":"The knowledge complexity of interactive proof systems","volume":"18","author":"Goldwasser","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00169-Y_BIB8","first-page":"453","article-title":"NP-complete problems in cellular automata","volume":"1","author":"Green","year":"1987","journal-title":"Complex Systems"},{"key":"10.1016\/0020-0190(94)00169-Y_BIB9","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01020648","article-title":"Exact results for deterministic cellular automata with additive rules","volume":"43","author":"Guan","year":"1986","journal-title":"J. Statist. Phys."},{"key":"10.1016\/0020-0190(94)00169-Y_BIB10","series-title":"The Graph Isomorphism Problem \u2014 Its Structural Complexity","author":"Koebler","year":"1993"},{"key":"10.1016\/0020-0190(94)00169-Y_BIB11","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01223745","article-title":"Algebraic properties of cellular automata","volume":"93","author":"Martin","year":"1984","journal-title":"Comm. Math. Phys."},{"issue":"1","key":"10.1016\/0020-0190(94)00169-Y_BIB12","first-page":"107","article-title":"A note on Culik-Yu classes","volume":"3","author":"Sutner","year":"1989","journal-title":"Complex Systems"},{"key":"10.1016\/0020-0190(94)00169-Y_BIB13","article-title":"On the computational complexity of finite cellular automata","author":"Sutner","year":"1989"},{"key":"10.1016\/0020-0190(94)00169-Y_BIB14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0167-2789(90)90185-R","article-title":"Invertible cellular automata: A review","volume":"45","author":"Toffoli","year":"1990","journal-title":"Phys. D"},{"key":"10.1016\/0020-0190(94)00169-Y_BIB15","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01217347","article-title":"Computation theory of cellular automata","volume":"96","author":"Wolfram","year":"1984","journal-title":"Comm. Math. Phys."},{"key":"10.1016\/0020-0190(94)00169-Y_BIB16","series-title":"Theory and Applications of Cellular Automata","author":"Wolfram","year":"1986"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400169Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400169Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T02:57:56Z","timestamp":1555297076000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909400169Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["002001909400169Y"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00169-y","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}