Approximation and robustness of fuzzy finite automata

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 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, Approximation and universality of fuzzy Turing machines, Myhill-Nerode type theory for fuzzy languages and automata, Grammar theory based on lattice-ordered monoid, Fuzzy multiset finite automata and their languages

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