{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:30:12Z","timestamp":1771702212413,"version":"3.50.1"},"reference-count":31,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":["Journal of Systems Architecture"],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1016\/s1383-7621(00)00038-2","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T18:33:56Z","timestamp":1049740436000},"page":"15-28","source":"Crossref","is-referenced-by-count":3,"title":["Symbolic two-dimensional minimization of strongly unspecified finite state machines"],"prefix":"10.1016","volume":"47","author":[{"given":"M.A","family":"Perkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L","family":"J\u00f3\u017awiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1383-7621(00)00038-2_BIB1","doi-asserted-by":"crossref","unstructured":"P. Ashar, S. Devadas, A.R. Newton, A unified approach to the decomposition and re-decomposition of sequential machines, in: Proceedings of the 27th A.C.M.\/I.E.E.E. Design Automation Conference, 1990, pp. 601\u2013606","DOI":"10.1145\/123186.123414"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB2","doi-asserted-by":"crossref","unstructured":"P. Ashar, S. Devadas, A.R. Newton, Testability driven synthesis of interacting finite state machines, in: Proceedings of the International Conference on Computer Aided Design, 1990, pp. 273\u2013276","DOI":"10.1109\/ICCD.1990.130225"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB3","doi-asserted-by":"crossref","unstructured":"J. Barzdins, G. Barzdins, K. Apsitis, U. Sarkans, Towards efficient inductive synthesis of expressions from input\/output examples, Lecture Notes in Computer Science, vol. 744, Springer, 1993, pp. 59\u201372","DOI":"10.1007\/3-540-57370-4_37"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB4","doi-asserted-by":"crossref","unstructured":"G. DeMicheli, R. Brayton, A.L. Sangiovanni-Vincentelli, Optimal state assignment for finite state machines, IEEE Transactions on Computer-Aided Design CAD-4 (1985) 269\u2013285","DOI":"10.1109\/TCAD.1985.1270123"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB5","doi-asserted-by":"crossref","unstructured":"G. DeMicheli, T. Klein, Algorithms for synchronous logic design, in: Proceedings of the International Symposium on Circuits and Systems, 1989, pp. 756\u2013761","DOI":"10.1109\/ISCAS.1989.100461"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB6","doi-asserted-by":"crossref","unstructured":"S. Devadas, Approaches to multi-level sequential logic syntesis, in: Proceedings of the 26th A.C.M.\/I.E.E.E. Design Automation Conference, 1989, pp. 270\u2013276","DOI":"10.1145\/74382.74428"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB7","doi-asserted-by":"crossref","unstructured":"S. Devadas, A. Newton, Exact algorithms for output encoding, state assignment and four-level Boolean minimization, in: Proceedings of the Hawaii International Conference on System Sciences, 1990, pp. 387\u2013396","DOI":"10.1109\/HICSS.1990.205139"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB8","doi-asserted-by":"crossref","unstructured":"A. Ghosh, S. Devadas, A. Newton, Verification of interacting sequential circuits, in: Proceedings of the 27th A.C.M.\/I.E.E.E. Design Automation Conference, 1990, pp. 213\u2013219","DOI":"10.1145\/123186.123260"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB9","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/PGEC.1965.264140","article-title":"A method for minimizing the number of internal states in incompletely specified sequential networks","volume":"14","author":"Grasselli","year":"1965","journal-title":"IEEE Transactions on Electron. Computers EC"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB10","doi-asserted-by":"crossref","unstructured":"A. Grasselli, F. Luccio, A method for the combined row-column reduction of flow tables, in: Proceedings of the Seventh Annual Symposium on Switching and Automata Theory, New York, 1966, pp. 136\u2013147","DOI":"10.1109\/SWAT.1966.1"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB11","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1109\/T-C.1970.222842","article-title":"A new rule for reducing CC tables","volume":"C-19","author":"House","year":"1970","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB12","doi-asserted-by":"crossref","unstructured":"B. Iyer, M. Ciesielski, Reencoding for cycle-time minimization under fixed encoding, in: Proceedings of the ICCAD'98 6B.1, pp. 312\u2013318","DOI":"10.1145\/288548.288631"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB13","unstructured":"Z. Kohavi, Switching and Finite Automata Theory, McGraw Hill, New York, 1978"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB14","unstructured":"E.B. Lee, M.A. Perkowski, Concurrent minimization and state assignment of finite state machines, in: Proceedings of the International IEEE Conference on Systems, Man, and Cybernetics, Halifax, Nova Scotia, 1986, pp. 248\u2013260"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB15","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/PGEC.1966.264573","article-title":"Reduction of the number of columns in flow table minimization","volume":"EC-15","author":"Luccio","year":"1966","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB16","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":"10.1016\/S1383-7621(00)00038-2_BIB17","first-page":"450","article-title":"Conditions for the existence of minimal closed covers composed of maximal compatibles","volume":"C-20","author":"Pager","year":"1971","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB18","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":"EC-8","author":"Paul","year":"1959","journal-title":"IRE Transactions on Electron. Computers"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB19","unstructured":"M.A. Perkowski, N. Nguyen, Minimization of finite state machines in system superpeg, in: Proceedings of the Midwest Symposium on Circuits and Systems, Luisville, Kentucky, 1985, pp. 139\u2013147"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB20","unstructured":"M.A. Perkowski, J. Liu, J.E. Brown, Rapid software prototyping: CAD design of digital CAD algorithms, in: G.W. Zobrist (Ed.), Progress in computer-aided VLSI design tools, Ablex 1, 1989, pp. 353\u2013401"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB21","doi-asserted-by":"crossref","unstructured":"M.A. Perkowski, J. Liu, Generation of finite state machines from parallel program graphs in DIADES, in: Proceedings of the IEEE International Symposium on Circuits and Systems, 1990, pp. 1139\u20131142","DOI":"10.1109\/ISCAS.1990.112320"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB22","doi-asserted-by":"crossref","unstructured":"M.A. Perkowski, L.B. Nguyen, An encoding program for concurrent finite state machines realized in constrained logic, in: Proceedings of the Midwest Symposium on Circuits and Systems, Calgary, Alberta, Canada, 1990, pp. 204\u2013207","DOI":"10.1109\/MWSCAS.1990.140687"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB23","doi-asserted-by":"crossref","unstructured":"M.A. Perkowski, P. Dysko, B. Falkowski, Two learning methods for a tree-search combinational optimizer, in: Proceedings of the International Phoenix Conference on Computers and Communication, Scottsdale, Arizona, March, 1990, pp. 606\u2013613","DOI":"10.1109\/PCCC.1990.101676"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB24","doi-asserted-by":"crossref","unstructured":"M.A. Perkowski, M. Marek-Sadowska, L. J\u00f3\u017awiak, T. Luba, S. Grygiel, M. Nowicka, R. Malvi, Z. Wang, J.S. Zhang, Decomposition of multiple-valued relations, in: Proceedings of the ISMVL Conference, 1997, pp. 13\u201318","DOI":"10.1109\/ISMVL.1997.601367"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB25","unstructured":"M.A. Perkowski, L. J\u00f3\u017awiak, D. Foote, Architecture of a programmable FPGA coprocessor for constructive induction approach to machine learning and other discrete optimization problems, in: Proceedings of the fourth Reconfigurable Architectures Workshop, 11th International Parallel Processing Symposium, Geneva, Switzerland, 1\u20135 April 1997, 33\u201340"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB26","doi-asserted-by":"crossref","unstructured":"M.A. Perkowski, A.N. Chebotarev, A.A. Mishchenko, Evolvable hardware or learning hardware? induction of state machines from temporal logic constraints, The First NASA\/DOD Workshop on Evolvable Hardware (NASA\/DOD-EH 99), Jet Propulsion Laboratory, Pasadena, CA, USA, 9\u201321 July 1999","DOI":"10.1109\/EH.1999.785444"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB27","doi-asserted-by":"crossref","unstructured":"I. Noda, M. Nagao, A learning method for recurrent networks based on minimization of finite automata, in: Proceedings of the IJCNN'92, Baltimore, June 1992, pp. 127\u2013132","DOI":"10.1109\/IJCNN.1992.287211"},{"issue":"2","key":"10.1016\/S1383-7621(00)00038-2_BIB28","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/43.259940","article-title":"Exact and heuristic algorithms for the minimization of incompletely specified state machines","volume":"13","author":"Rho","year":"1994","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB29","doi-asserted-by":"crossref","unstructured":"K.E. Stoffers, Sequential algorithm for the determination of maximum compatibles, IEEE Transactions on Computers, 1974, pp. 95\u201398","DOI":"10.1109\/T-C.1974.223786"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB30","unstructured":"B. Trakhtenbrot, Ya. Barzdin, Finite Automata: Behavior and Synthesis, North-Holland Publishing Company, Amsterdam, 1973"},{"key":"10.1016\/S1383-7621(00)00038-2_BIB31","doi-asserted-by":"crossref","unstructured":"S. Yang, M. Ciesielski, Optimum and suboptimum algorithms for input encoding and its relationship to logic minimization, IEEE Transactions on CAD, 10(1) January 1991, pp. 4\u201312","DOI":"10.1109\/43.62787"}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762100000382?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762100000382?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T10:10:32Z","timestamp":1733393432000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1383762100000382"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["S1383762100000382"],"URL":"https:\/\/doi.org\/10.1016\/s1383-7621(00)00038-2","relation":{},"ISSN":["1383-7621"],"issn-type":[{"value":"1383-7621","type":"print"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}