{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T11:02:12Z","timestamp":1781175732872,"version":"3.54.1"},"reference-count":0,"publisher":"Walter de Gruyter GmbH","issue":"2","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Finite state machines have been used in many contexts, e.g., test generation, system modeling, language processing. In these applications, the size of the machine has a great impact on the complexity and quality of the results. Thus, it is desirable to obtain a machine without redundant states, i.e., to minimize the machine. However, the minimization of partially specified finite state machines is a known NP-complete problem, and many heuristics to obtain feasible solutions have been proposed. In this paper, we propose an approach to minimize partial finite state machines based on the selection of compatible states using maximum cliques on the distinction graph. We experimented with our method comparing it with previous methods and the data suggest that our approach is more efficient, generating good results in less time.<\/jats:p>","DOI":"10.2478\/s13537-013-0106-0","type":"journal-article","created":{"date-parts":[[2013,6,27]],"date-time":"2013-06-27T23:50:46Z","timestamp":1372377046000},"page":"91-103","source":"Crossref","is-referenced-by-count":3,"title":["Iterative minimization of partial finite state machines"],"prefix":"10.2478","volume":"3","author":[{"given":"Alex","family":"Alberto","sequence":"first","affiliation":[{"name":"Instituto de Ci\u00eancias Matem\u00e1ticas e Computa\u00e7\u00e3o, Universidade de S\u00e3o Paulo, S\u00e3o Carlos, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adenilso","family":"Simao","sequence":"additional","affiliation":[{"name":"Instituto de Ci\u00eancias Matem\u00e1ticas e Computa\u00e7\u00e3o, Universidade de S\u00e3o Paulo, S\u00e3o Carlos, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"374","published-online":{"date-parts":[[2013,6,29]]},"container-title":["Open Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.2478\/s13537-013-0106-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.2478\/s13537-013-0106-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.2478\/s13537-013-0106-0\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.2478\/s13537-013-0106-0\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T08:36:22Z","timestamp":1651048582000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.2478\/s13537-013-0106-0\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,1]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2013,6,29]]},"published-print":{"date-parts":[[2013,6,1]]}},"alternative-id":["10.2478\/s13537-013-0106-0"],"URL":"https:\/\/doi.org\/10.2478\/s13537-013-0106-0","relation":{},"ISSN":["2299-1093"],"issn-type":[{"value":"2299-1093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,1]]}}}