Approximation and robustness of fuzzy finite automata
From MaRDI portal
Publication:2270389
DOI10.1016/j.ijar.2007.05.004zbMath1184.68319OpenAlexW2059398904MaRDI QIDQ2270389
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
Related Items
On fuzzy multiset automata, Approximation of fuzzy context-free grammars, Weighted finite automata over strong bimonoids, Robustness of \(f\)- and \(g\)-generated fuzzy (co)implications: the Yager's (co)implication case study, Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness, Synthesizing fuzzy tree automata, Robustness analysis of logic metrics on \(F(X)\), Approximate positional analysis of fuzzy social networks, Characterization and computation of approximate bisimulations for fuzzy automata, Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them, Approximate State Reduction of Fuzzy Finite Automata, Fuzzy multiset finite automata and their languages, Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures, Nondeterministic fuzzy automata with membership values in complete residuated lattices, Approximation and universality of fuzzy Turing machines, Model checking fuzzy computation tree logic, Myhill-Nerode type theory for fuzzy languages and automata, On the robustness of type-1 and interval type-2 fuzzy logic systems in modeling, Nondeterministic fuzzy automata, Approximate bisimulation relations for fuzzy automata, Grammar theory based on lattice-ordered monoid, Intuitionistic fuzzy \(( \otimes,N)\)-general regular languages and their minimization implementation, Bipolar Fuzzy Preorder, Alexandrov Bipolar Fuzzy Topology and Bipolar Fuzzy Automata, On robustness of the full implication triple I inference method with respect to finer measurements, Simulation for lattice-valued doubly labeled transition systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Complexity issues in Basic Logic
- Arithmetical complexity of fuzzy predicate logics -- a survey
- The equivalence between fuzzy Mealy and fuzzy Moore machines
- Metamathematics of fuzzy logic
- Regularity and chaos in recurrent fuzzy systems.
- Triangular norms
- New directions in fuzzy automata
- The relationships among several types of fuzzy automata
- Algebraic properties of \(LA\)-languages
- An approach to measure the robustness of fuzzy reasoning
- Quantum Complexity Theory
- A framework for defining and learning fuzzy behaviors for autonomous mobile robots
