Update Law of Simplifying Finite State Machines (FSMs): An Answer to the Open Question of the Unmanned Optimization of FSMs

Update Law of Simplifying Finite State Machines (FSMs): An Answer to the Open Question of the Unmanned Optimization of FSMs

This brief gives an answer to the open problem on the unmanned optimization of finite state machines by designing an update law of simplifying finite state machines in the framework of semi-tensor product of matrices (STP).

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on circuits and systems. II, Express briefs Express briefs, 2022-03, Vol.69 (3), p.1164-1167
Hauptverfasser: Yue, Jumei, Yan, Yongyi
Format: Artikel
Sprache:eng
Schlagworte:
Automata
Circuits and systems
Complexity theory
Finite state machines
finite-valued systems
Heuristic algorithms
logical systems
matrix approach
Merging
Optimization
Partitioning algorithms
semi-tensor product of matrices
Tensors
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This brief gives an answer to the open problem on the unmanned optimization of finite state machines by designing an update law of simplifying finite state machines in the framework of semi-tensor product of matrices (STP).
ISSN:1549-7747
1558-3791
DOI:10.1109/TCSII.2021.3095144