{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:16:30Z","timestamp":1774415790772,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Electrical Engineering"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s0045-7906(00)00016-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:11:16Z","timestamp":1027624276000},"page":"159-172","source":"Crossref","is-referenced-by-count":11,"title":["A heuristic algorithm for the minimization of incompletely specified finite state machines"],"prefix":"10.1016","volume":"27","author":[{"given":"Imtiaz","family":"Ahmad","sequence":"first","affiliation":[]},{"given":"A.Shoba","family":"Das","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0045-7906(00)00016-1_BIB1","doi-asserted-by":"crossref","unstructured":"Grasselli A, Luccio F. A method for minimizing the number of internal states in incompletely specified sequential networks. IEEE Transactions on Electronic Computers, June 1965:350\u201359","DOI":"10.1109\/PGEC.1965.264140"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB2","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1007\/BF00263650","article-title":"Minimal coverings for incompletely specified sequential machines","volume":"22","author":"Reusch","year":"1986","journal-title":"Acta Informatica"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB3","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1109\/T-C.1973.223655","article-title":"State reduction in incompletely specified finite state machines","volume":"22","author":"Pfleeger","year":"1973","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB4","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1109\/T-C.1975.224137","article-title":"Minimization of incompletely specified sequential machines","volume":"24","author":"Rao","year":"1975","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB5","first-page":"450","article-title":"Conditions for existence of minimal closed covers composed of maximal compatibles","volume":"20","author":"Pager","year":"1971","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB6","series-title":"Logic synthesis and verification algorithms","author":"Hachtel","year":"1996"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB7","article-title":"A fast state reduction algorithm for incompletely specified finite state machines","author":"Higuchi","year":"1996"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB8","first-page":"324","article-title":"The role of prime compatibles in the minimization of finite state machines","author":"Rho","year":"1992"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/43.259940","article-title":"Exact and heuristic algorithms for minimization of incompletely specified state machines","volume":"13","author":"Rho","year":"1994","journal-title":"IEEE Transactions on Computer-Aided Design"},{"issue":"5","key":"10.1016\/S0045-7906(00)00016-1_BIB10","first-page":"463","article-title":"A genetic algorithm for reducing the number of states in incompletely specified finite state machines","volume":"26","author":"Sanchez","year":"1995","journal-title":"Micro Electronic Journal"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB11","first-page":"192","article-title":"Fast heuristic algorithm for finite state minimization","author":"Kannan","year":"1991"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB12","first-page":"139","article-title":"Minimization of finite state machine in system superpeg","author":"Perkowski","year":"1985"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB13","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1109\/TEC.1959.5222697","article-title":"Minimizing the number of states in incompletely specified sequential switching functions","volume":"8","author":"Paul","year":"1959","journal-title":"IRE Transactions on Electronic Computers"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB14","first-page":"440","article-title":"New approach to the state reduction in incompletely specified sequential machines","author":"Avedillo","year":"1990"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB15","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/T-C.1973.223687","article-title":"Fast state minimization of incompletely specified sequential machines","volume":"22","author":"Gupta","year":"1973","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB16","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1109\/T-C.1971.223221","article-title":"An improved method of prime C-class derivation in the state reduction of sequential networks","volume":"20","author":"Bennetts","year":"1971","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB17","first-page":"308","article-title":"OPTIMIST: state minimization for optimal 2-level logic implementation","author":"Fuhrer","year":"1997"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB18","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1109\/43.229748","article-title":"An Efficient Algorithm to Search for Minimal Closed Covers in Sequential Machines","volume":"12","author":"Puri","year":"1993","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB19","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1109\/T-C.1969.222552","article-title":"Simplification of incompletely specified flow tables with the help of prime closed sets","volume":"18","author":"DeSarkar","year":"1969","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB20","unstructured":"Yang S. Logic synthesis and optimization benchmarks user guide. Version 3.0, MCNC, 1991"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB21","first-page":"684","article-title":"A fully implicit algorithm for exact state minimization","author":"Kam","year":"1994"},{"key":"10.1016\/S0045-7906(00)00016-1_BIB22","series-title":"Switching and finite automata theory","author":"Kohavi","year":"1978"}],"container-title":["Computers & Electrical Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0045790600000161?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0045790600000161?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T23:20:29Z","timestamp":1555975229000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0045790600000161"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0045790600000161"],"URL":"https:\/\/doi.org\/10.1016\/s0045-7906(00)00016-1","relation":{},"ISSN":["0045-7906"],"issn-type":[{"value":"0045-7906","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}