Approximation and robustness of fuzzy finite automata

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

Publication:2270389


DOI10.1016/j.ijar.2007.05.004zbMath1184.68319MaRDI QIDQ2270389

Yong-Ming Li

Publication date: 18 March 2010

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2007.05.004

zbMATH Keywords

robustness; approximation; deterministic fuzzy finite automaton; nondeterministic fuzzy finite automaton


Mathematics Subject Classification ID

68Q45: Formal languages and automata


Related Items

On fuzzy multiset automata, Nondeterministic fuzzy automata with membership values in complete residuated lattices, Model checking fuzzy computation tree logic, On the robustness of type-1 and interval type-2 fuzzy logic systems in modeling, Nondeterministic fuzzy automata, Approximation of fuzzy context-free grammars, Weighted finite automata over strong bimonoids, Robustness analysis of logic metrics on \(F(X)\), Approximation and universality of fuzzy Turing machines, Myhill-Nerode type theory for fuzzy languages and automata, Grammar theory based on lattice-ordered monoid, Approximate bisimulation relations for fuzzy automata, Fuzzy multiset finite automata and their languages, On robustness of the full implication triple I inference method with respect to finer measurements, Simulation for lattice-valued doubly labeled transition systems, Robustness of \(f\)- and \(g\)-generated fuzzy (co)implications: the Yager's (co)implication case study



Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2270389&oldid=14829511"
Powered by MediaWiki