{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T18:35:49Z","timestamp":1694630149252},"reference-count":1,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[1976,7,1]],"date-time":"1976-07-01T00:00:00Z","timestamp":205027200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1976,7]]},"DOI":"10.1109\/tc.1976.1674690","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"767-768","source":"Crossref","is-referenced-by-count":1,"title":["Further Comments on \"Closure Partition Method for Minimizing Incomplete Sequential Machines\""],"prefix":"10.1109","volume":"C-25","author":[{"family":"Rao","sequence":"first","affiliation":[]},{"family":"Biswas","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224090"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35149\/01674690.pdf?arnumber=1674690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:39:26Z","timestamp":1638200366000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1674690\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,7]]},"references-count":1,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tc.1976.1674690","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[1976,7]]}}}