A Simplifying-Matrix Method to Reduce the Storage Complexity in Studying Finite State Machines in the Framework of STP

The storage complexity problem is one of the severe challenges faced by research of finite state machines (FSMs) in the framework of STP, which must be overcome to make theoretical methodologies applicable to real applications. In this brief we propose a simplifying-matrix method to reduce the compl...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on circuits and systems. II, Express briefs Express briefs, 2023-01, Vol.70 (1), p.196-200
Hauptverfasser:	Yue, Jumei, Yan, Yongyi, Chen, Zengqiang
Format:	Artikel
Sprache:	eng
Schlagworte:	Automata Complexity Complexity theory Computational modeling Computers Dynamical systems Finite state machines finite-valued systems Fuzzy control Fuzzy logic Fuzzy systems logical systems Manganese Mapping Mathematical analysis Mathematical models Matrices matrix approach Matrix methods Scalars semi-tensor product of matrices Storage
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!