-language approximation of nondeterministic fuzzy finite automata

zbMATH Open1474.68183MaRDI QIDQ4996151FDOQ4996151

Authors: Haihui Wang, Luyao Zhao, Ping Li 

Publication date: 1 July 2021

Recommendations

• Approximation and robustness of fuzzy finite automata
• Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them
• Nondeterministic fuzzy automata
• Non deterministic recognizability of fuzzy languages
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids

zbMATH Keywords

robustnessfuzzy finite automatalanguage approximation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cited In (6)

• Deterministic Fuzzy Automata on Fuzzy Regular ω-Languages
• General-nondeterministic fuzzy pushdown automata and their languages
• Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them
• Fuzzy automata with \(\varepsilon\)-moves compute fuzzy measures between strings
• Approximation and robustness of fuzzy finite automata
• Title not available (Why is that?)

This page was built for publication: \(\varepsilon\)-language approximation of nondeterministic fuzzy finite automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4996151)