The equivalence between fuzzy Mealy and fuzzy Moore machines
From MaRDI portal
Publication:862553
DOI10.1007/s00500-005-0022-xzbMath1109.68059OpenAlexW2090150751WikidataQ62038249 ScholiaQ62038249MaRDI QIDQ862553
Publication date: 24 January 2007
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-005-0022-x
equivalencefuzzy Mealy machinefuzzy Moore machinefuzzy sequential-like machinelattice-ordered monoid
Related Items
Unnamed Item, Minimization of states in automata theory based on finite lattice-ordered monoids, Automata theory based on lattice-ordered semirings, Minimal realization for fuzzy behaviour: A bicategory-theoretic approach, Algebraic properties on the cuts of lattice-valued regular languages, Determinization of fuzzy automata with membership values in complete residuated lattices, DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA, Myhill-Nerode type theory for fuzzy languages and automata, Formal power series and regular operations on fuzzy languages, Approximation and robustness of fuzzy finite automata, Automata theory based on complete residuated lattice-valued logic: Reduction and minimization, Weighted finite automata with output, Grammar theory based on lattice-ordered monoid
Cites Work
- Equivalence, reduction and minimization of finite fuzzy-automata
- Equivalence, reduction and minimization of finite automata over semirings
- On quotient machines of a fuzzy automaton and the minimal machine
- Semigroup homomorphisms and fuzzy automata
- Finite \(L\)-fuzzy machines.
- Minimization algorithm of fuzzy finite automata.
- Remarks on uninorm aggregation operators
- Minimization of fuzzy finite automata
- On the torsion points of Drinfeld modules in abelian extensions
- Aggregation operators and fuzzy systems modeling
- Max-product machines
- On reductions of maximin machines
- General formulation of sequential machines
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item