Nondeterministic fuzzy automata
From MaRDI portal
Publication:712503
Abstract: Fuzzy automata have long been accepted as a generalization of nondeterministic finite automata. A closer examination, however, shows that the fundamental property---nondeterminism---in nondeterministic finite automata has not been well embodied in the generalization. In this paper, we introduce nondeterministic fuzzy automata with or without -moves and fuzzy languages recognized by them. Furthermore, we prove that (deterministic) fuzzy automata, nondeterministic fuzzy automata, and nondeterministic fuzzy automata with -moves are all equivalent in the sense that they recognize the same class of fuzzy languages.
Recommendations
- \(\varepsilon\)-language approximation of nondeterministic fuzzy finite automata
- Determinism and fuzzy automata
- Non deterministic recognizability of fuzzy languages
- Approximation and robustness of fuzzy finite automata
- Nondeterministic fuzzy automata with membership values in complete residuated lattices
Cites work
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3632385 (Why is no real title available?)
- scientific article; zbMATH DE number 2012399 (Why is no real title available?)
- scientific article; zbMATH DE number 1862743 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Algebraic aspects of families of fuzzy languages
- An improved algorithm for determinization of weighted and fuzzy automata
- Approximation and robustness of fuzzy finite automata
- Characterizations of fuzzy finite automata.
- Determinism and fuzzy automata
- Determinization of weighted finite automata over strong bimonoids
- Finite automata theory with membership values in lattices
- Formal power series and regular operations on fuzzy languages
- Fuzzy \(\omega\)-automata
- Fuzzy automata and languages
- Fuzzy automata with \(\varepsilon\)-moves compute fuzzy measures between strings
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Fuzzy pushdown automata
- Fuzzy sets and systems. Theory and applications
- Fuzzy tree automata
- Is there a need for fuzzy logic?
- New directions in fuzzy automata
- On fuzzy regular languages
- Pattern recognition using temporal fuzzy automata
- Some considerations on Fuzzy automata
- The relationships among several types of fuzzy automata
- Toward a generalized theory of uncertainty (GTU) -- an outline
- Weighted finite automata over strong bimonoids
Cited in
(27)- scientific article; zbMATH DE number 1487544 (Why is no real title available?)
- Distribution-based limited fuzzy bisimulations for nondeterministic fuzzy transition systems
- Bisimulations for fuzzy transition systems revisited
- Fuzzy state grammar and fuzzy deep pushdown automaton
- Coalgebras for fuzzy transition systems
- General-nondeterministic fuzzy pushdown automata and their languages
- scientific article; zbMATH DE number 897251 (Why is no real title available?)
- Fuzzy alternating automata over distributive lattices
- BL-general fuzzy automata and minimal realization: based on the associated categories
- Intuitionistic fuzzy \(( \otimes,N)\)-general regular languages and their minimization implementation
- On minimal realization of fuzzy behaviour and associated categories
- scientific article; zbMATH DE number 3952016 (Why is no real title available?)
- Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems
- On typical hesitant fuzzy languages and automata
- Determinism and fuzzy automata
- Non deterministic recognizability of fuzzy languages
- Approximation and robustness of fuzzy finite automata
- Characterization and computation of approximate bisimulations for fuzzy automata
- Conversion of fuzzy automata into fuzzy regular expressions using transitive closure
- Polynomial-time algorithms for computing distances of fuzzy transition systems
- \(\varepsilon\)-language approximation of nondeterministic fuzzy finite automata
- A comment on ``Construction of fuzzy automata from fuzzy regular expressions
- On typical hesitant fuzzy automata
- Nondeterministic fuzzy automata with membership values in complete residuated lattices
- Distinguishability and completeness of crisp deterministic fuzzy automata
- Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
This page was built for publication: Nondeterministic fuzzy automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712503)