{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T20:20:19Z","timestamp":1694636419466},"reference-count":10,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[1976,3,1]],"date-time":"1976-03-01T00:00:00Z","timestamp":194486400000},"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,3]]},"DOI":"10.1109\/tc.1976.5009258","type":"journal-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T20:36:47Z","timestamp":1243975007000},"page":"306-311","source":"Crossref","is-referenced-by-count":2,"title":["Optimum State Assignment for the D Flip-Flop"],"prefix":"10.1109","volume":"C-25","author":[{"given":"P. S.","family":"Noe","sequence":"first","affiliation":[]},{"given":"V. T.","family":"Rhyne","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","article-title":"optimum state assignment for sequential machines with flip-flop memory","author":"harrison","year":"1973","journal-title":"IEEE Comput Soc Repository"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1974.223933"},{"key":"ref10","article-title":"a new boolean function minimization algorithm, part ithe algorithm, part iicomputer and hand computation","author":"mckinney","year":"1975","journal-title":"IEEE Comput Soc Repository"},{"key":"ref6","author":"rhyne","year":"1975","journal-title":"On the number of distinct state assignments for a sequential machine"},{"key":"ref5","article-title":"minimum-cost excitation of the delay storage element","author":"rhyne","year":"1975","journal-title":"IEEE Comput Soc Respository"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1967.264577"},{"key":"ref7","author":"harrison","year":"1972","journal-title":"State assignment optimization for synchronous sequential machines with flip-flop memory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1973.5009187"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1964.263726"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1972.223508"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/5009242\/05009258.pdf?arnumber=5009258","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:39:29Z","timestamp":1638218369000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5009258\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,3]]},"references-count":10,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tc.1976.5009258","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[1976,3]]}}}