Pages that link to "Item:Q2270389"
From MaRDI portal
The following pages link to Approximation and robustness of fuzzy finite automata (Q2270389):
Displayed 16 items.
- On fuzzy multiset automata (Q295507) (← links)
- Nondeterministic fuzzy automata with membership values in complete residuated lattices (Q511624) (← links)
- Model checking fuzzy computation tree logic (Q529056) (← links)
- On the robustness of type-1 and interval type-2 fuzzy logic systems in modeling (Q543820) (← links)
- Nondeterministic fuzzy automata (Q712503) (← links)
- Approximation of fuzzy context-free grammars (Q845326) (← links)
- Weighted finite automata over strong bimonoids (Q845343) (← links)
- Robustness analysis of logic metrics on \(F(X)\) (Q891773) (← links)
- Approximation and universality of fuzzy Turing machines (Q954457) (← links)
- Myhill-Nerode type theory for fuzzy languages and automata (Q969583) (← links)
- Grammar theory based on lattice-ordered monoid (Q1037932) (← links)
- Approximate bisimulation relations for fuzzy automata (Q1800262) (← links)
- Fuzzy multiset finite automata and their languages (Q1955451) (← links)
- On robustness of the full implication triple I inference method with respect to finer measurements (Q2353986) (← links)
- Simulation for lattice-valued doubly labeled transition systems (Q2353987) (← links)
- Robustness of \(f\)- and \(g\)-generated fuzzy (co)implications: the Yager's (co)implication case study (Q2397228) (← links)