{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T05:53:45Z","timestamp":1676440425464},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"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":8932,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,2]]},"DOI":"10.1016\/0304-3975(89)90079-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"223-237","source":"Crossref","is-referenced-by-count":1,"title":["Structural and behavioral equivalence relations in automata networks"],"prefix":"10.1016","volume":"63","author":[{"given":"Takashi","family":"Saito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hidenosuke","family":"Nishio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90079-0_bib1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0019-9958(69)90090-4","article-title":"Tessellation automata","volume":"14","author":"Yamada","year":"1969","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(89)90079-0_bib2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(71)90281-6","article-title":"Structural and behavioral equivalences of tessellation automata","volume":"18","author":"Yamada","year":"1971","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(89)90079-0_bib3","article-title":"Essays on Cellular Automata","year":"1970"},{"key":"10.1016\/0304-3975(89)90079-0_bib4","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0304-3975(89)90079-0_bib5","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/S0019-9958(74)80024-0","article-title":"On the interconnection structure of cellular networks","volume":"24","author":"Jump","year":"1974","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(89)90079-0_bib6","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/S0019-9958(80)90074-1","article-title":"Formal expressions of infinite graphs and their families","volume":"44","author":"Okabe","year":"1980","journal-title":"Inform. and Control."},{"key":"10.1016\/0304-3975(89)90079-0_bib7","series-title":"Graph Theory and Computing","first-page":"219","article-title":"Intelligent graphs","author":"Rosenstiehl","year":"1972"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900790?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900790?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:55:11Z","timestamp":1555127711000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["0304397589900790"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90079-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,2]]}}}