Automata theory based on complete residuated lattice-valued logic: Reduction and minimization

Automata theory based on complete residuated lattice-valued logic, called L- valued finite automata ( L- VFAs), has been established by Qiu recently. In this paper, we define a kind of Mealy type of L- VFAs ( MLFAs), a generalization of L- VFAs. Two kinds of statewise equivalence relations are intro...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Fuzzy sets and systems 2010-06, Vol.161 (12), p.1635-1656
Hauptverfasser:	Wu, Lihua, Qiu, Daowen
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Automata theory Circuit properties Combinatorics. Ordered structures Computer science control theory systems Digital circuits Electric, optical and optoelectronic circuits Electronic circuits Electronics Exact sciences and technology Finite automata Fuzzy regular languages Fuzzy set theory Information, signal and communications theory Logic Mathematical analysis Mathematical methods Mathematics Minimization Miscellaneous Non-classical logic Optimization Order, lattices, ordered algebraic structures Reduction Reduction and minimization Residuated lattices Sciences and techniques of general use Telecommunications and information theory Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!