Minimization of fuzzy finite automata

From MaRDI portal
Revision as of 09:40, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1818961

DOI10.1016/S0020-0255(98)10073-7zbMath0948.68110MaRDI QIDQ1818961

Yanyan Li

Publication date: 5 January 2000

Published in: Information Sciences (Search for Journal in Brave)




Related Items (24)

The universal fuzzy automatonEquivalence in automata theory based on complete residuated lattice-valued logicMinimization of lattice finite automata and its application to the decomposition of lattice languagesThe equivalence between fuzzy Mealy and fuzzy Moore machinesMinimization of states in automata theory based on finite lattice-ordered monoidsOn the greatest solutions to weakly linear systems of fuzzy relation inequalities and equationsBisimulations for fuzzy automataFrom classic observability to a simple fuzzy observability for fuzzy discrete-event systemsSyntactic recognizability of graphs with fuzzy attributesCharacterizations of fuzzy finite automata.Finite \(L\)-fuzzy machines.Minimization algorithm of fuzzy finite automata.On minimal realization for a fuzzy language and Brzozowski’s algorithmDiagnosability of fuzzy discrete event systemsFurther improvements of determinization methods for fuzzy finite automataConstruction of fuzzy automata from fuzzy regular expressionsA remark on Myhill-Nerode theorem for fuzzy languagesMyhill-Nerode type theory for fuzzy languages and automataFuzzy relation equations and reduction of fuzzy automataReduction of fuzzy automata by means of fuzzy quasi-ordersMinimizing Deterministic Lattice AutomataProducts of Mealy-type fuzzy finite state machinesAlgebraic properties of intuitionistic \(L\)-fuzzy multiset finite automataCongruences and homomorphisms of fuzzy automata




Cites Work




This page was built for publication: Minimization of fuzzy finite automata