{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T06:05:36Z","timestamp":1648620336032},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1981,2,1]],"date-time":"1981-02-01T00:00:00Z","timestamp":349833600000},"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 Sciences"],"published-print":{"date-parts":[[1981,2]]},"DOI":"10.1016\/0020-0255(81)90038-4","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"25-30","source":"Crossref","is-referenced-by-count":2,"title":["Relation of one-way parallel\/sequential automata to 2-D finite-state automata"],"prefix":"10.1016","volume":"23","author":[{"given":"Charles R.","family":"Dyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(81)90038-4_BIB1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0020-0190(73)90011-2","article-title":"Parallel\/sequential array automata","volume":"2","author":"Rosenfeld","year":"1973","journal-title":"Information Processing Lett."},{"key":"10.1016\/0020-0255(81)90038-4_BIB2","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1145\/321694.321701","article-title":"One-pass complexity of digital picture properties","volume":"19","author":"Selkow","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0255(81)90038-4_BIB3","series-title":"Conference Record, IEEE 8th Annual Symposium on Switching and Automata Theory","first-page":"155","article-title":"Automata on a 2-dimensional tape","author":"Blum","year":"1967"},{"key":"10.1016\/0020-0255(81)90038-4_BIB4","series-title":"Picture Languages","author":"Rosenfeld","year":"1979"},{"key":"10.1016\/0020-0255(81)90038-4_BIB5_1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0255(80)90023-7","article-title":"A note on deterministic three-way tape-bounded two-dimensional Turing machines","volume":"20","author":"Inoue","year":"1980","journal-title":"Information Sci."},{"key":"10.1016\/0020-0255(81)90038-4_BIB5_2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0020-0255(80)90034-1","article-title":"A note on deterministic three-way tape-bounded two-dimensional Turing machines","volume":"21","author":"Inoue","year":"1980","journal-title":"Information Sci."},{"key":"10.1016\/0020-0255(81)90038-4_BIB6","article-title":"Accepting capability of offside-free two-dimensional marker automata\u2014the simulation of four-way automata by three-way tape-bounded Turing machines","author":"Morita","year":"1979"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025581900384?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025581900384?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:52:08Z","timestamp":1552913528000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025581900384"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,2]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,2]]}},"alternative-id":["0020025581900384"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(81)90038-4","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1981,2]]}}}