Iterative minimization of partial finite state machines

Abstract: 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.

Standort
Deutsche Nationalbibliothek Frankfurt am Main
Umfang
Online-Ressource
Sprache
Englisch

Erschienen in
Iterative minimization of partial finite state machines ; volume:3 ; number:2 ; year:2013 ; pages:91-103 ; extent:13
Open computer science ; 3, Heft 2 (2013), 91-103 (gesamt 13)

Urheber
Alberto, Alex
Simao, Adenilso

DOI
10.2478/s13537-013-0106-0
URN
urn:nbn:de:101:1-2410301517251.400744569622
Rechteinformation
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
Letzte Aktualisierung
15.08.2025, 07:39 MESZ

Datenpartner

Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.

Beteiligte

  • Alberto, Alex
  • Simao, Adenilso

Ähnliche Objekte (12)