{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T14:45:51Z","timestamp":1754145951681,"version":"3.41.2"},"reference-count":9,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[1980,8,1]],"date-time":"1980-08-01T00:00:00Z","timestamp":333936000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1980,8,1]],"date-time":"1980-08-01T00:00:00Z","timestamp":333936000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1980,8,1]],"date-time":"1980-08-01T00:00:00Z","timestamp":333936000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1980,8]]},"DOI":"10.1109\/tc.1980.1675655","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"732-736","source":"Crossref","is-referenced-by-count":3,"title":["A Method for Minimizing Incompletely Specified Sequential Machines"],"prefix":"10.1109","volume":"C-29","author":[{"family":"Yamamoto","sequence":"first","affiliation":[{"name":"Department of Management Engineering, Nagoya Institute of Technology"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1967.264674"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1109\/T-C.1969.222706","article-title":"extending the definition of prime compatibility classes of states in incomplete sequential machine reduction","volume":"c 18","author":"luccio","year":"1969","journal-title":"IEEE Transactions on Computers"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1109\/T-C.1973.223657","article-title":"closure partition method for minimizing incomplete sequential machines","volume":"c 22","author":"yang","year":"1973","journal-title":"IEEE Transactions on Computers"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1969.222552"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1109\/T-C.1975.224137","article-title":"minimization of incompletely specified sequential machines","volume":"c 24","author":"rao","year":"1975","journal-title":"IEEE Transactions on Computers"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1974.223780"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1965.264140"},{"journal-title":"Asynchronous Sequential Switching Circuits","year":"1969","author":"unger","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1959.5222697"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35196\/01675655.pdf?arnumber=1675655","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T17:56:30Z","timestamp":1752774990000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1675655\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,8]]},"references-count":9,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tc.1980.1675655","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"type":"print","value":"0018-9340"},{"type":"electronic","value":"1557-9956"},{"type":"electronic","value":"2326-3814"}],"subject":[],"published":{"date-parts":[[1980,8]]}}}