{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:44Z","timestamp":1759638764582},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,2,1]],"date-time":"1979-02-01T00:00:00Z","timestamp":286675200000},"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":12585,"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":[[1979,2]]},"DOI":"10.1016\/0022-0000(79)90048-5","type":"journal-article","created":{"date-parts":[[2003,12,5]],"date-time":"2003-12-05T11:41:56Z","timestamp":1070624516000},"page":"8-17","source":"Crossref","is-referenced-by-count":6,"title":["Equivalence problem of non-deterministic finite automata"],"prefix":"10.1016","volume":"18","author":[{"given":"A.","family":"Nozaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(79)90048-5_BIB1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/356608.356610","article-title":"A programmer's view of automata","volume":"4","author":"Barnes","year":"1972","journal-title":"Computing Surveys"},{"key":"10.1016\/0022-0000(79)90048-5_BIB2","series-title":"Automata, Languages, and Machines","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0022-0000(79)90048-5_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(74)80034-6","article-title":"Multiple-entry finite automata","volume":"9","author":"Gill","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(79)90048-5_BIB4","article-title":"A Linear Algorithm for Testing Equivalence of Finite Automata","author":"Hopcroft","year":"1971","journal-title":"Technical report of Cornell University, TR 71-114"},{"key":"10.1016\/0022-0000(79)90048-5_BIB5","series-title":"Automata Studies","first-page":"129","article-title":"Gedanken-experiments of sequential machines","author":"Moore","year":"1956"},{"key":"10.1016\/0022-0000(79)90048-5_BIB6","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1109\/T-C.1971.223108","article-title":"On the bounds for state-set size in the proofs of equivalence between deterministic, non-deterministic, and two-way finite automata","volume":"C-20","author":"Moore","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0022-0000(79)90048-5_BIB7","unstructured":"A. Nozaki, A note on the equivalence problem of non-deterministic finite automata, Technical report of Yamanashi University, to appear."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900485?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900485?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T12:20:33Z","timestamp":1550319633000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000079900485"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,2]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,2]]}},"alternative-id":["0022000079900485"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(79)90048-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1979,2]]}}}