Nondeterministic fuzzy automata
From MaRDI portal
Publication:712503
DOI10.1016/J.INS.2011.12.024zbMATH Open1248.68287arXiv1012.2162OpenAlexW1639750162MaRDI QIDQ712503FDOQ712503
Publication date: 17 October 2012
Published in: Information Sciences (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1012.2162
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
fuzzy automatonfuzzy languagenondeterministic finite automatonnondeterministic fuzzy automaton with \(\epsilon \)-moves
Cites Work
- Fuzzy sets and systems. Theory and applications
- Title not available (Why is that?)
- Is there a need for fuzzy logic?
- Fuzzy automata and languages
- On fuzzy regular languages
- Characterizations of fuzzy finite automata.
- Determinism and fuzzy automata
- Formal power series and regular operations on fuzzy languages
- Fuzzy automata with \(\varepsilon\)-moves compute fuzzy measures between strings
- Toward a generalized theory of uncertainty (GTU) -- an outline
- Title not available (Why is that?)
- An improved algorithm for determinization of weighted and fuzzy automata
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Finite automata theory with membership values in lattices
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Determinization of weighted finite automata over strong bimonoids
- Title not available (Why is that?)
- Approximation and robustness of fuzzy finite automata
- The relationships among several types of fuzzy automata
- Title not available (Why is that?)
- Fuzzy \(\omega\)-automata
- Weighted finite automata over strong bimonoids
- New directions in fuzzy automata
- Pattern recognition using temporal fuzzy automata
- Fuzzy tree automata
- Algebraic aspects of families of fuzzy languages
- Some considerations on Fuzzy automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fuzzy pushdown automata
Cited In (22)
- On typical hesitant fuzzy automata
- Coalgebras for fuzzy transition systems
- Distribution-based limited fuzzy bisimulations for nondeterministic fuzzy transition systems
- Characterization and computation of approximate bisimulations for fuzzy automata
- On minimal realization of fuzzy behaviour and associated categories
- Polynomial-time algorithms for computing distances of fuzzy transition systems
- Conversion of fuzzy automata into fuzzy regular expressions using transitive closure
- Bisimulations for fuzzy transition systems revisited
- Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems
- Title not available (Why is that?)
- Determinism and fuzzy automata
- BL-general fuzzy automata and minimal realization: Based on the associated categories
- General-nondeterministic fuzzy pushdown automata and their languages
- Fuzzy alternating automata over distributive lattices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Intuitionistic fuzzy \(( \otimes,N)\)-general regular languages and their minimization implementation
- Nondeterministic fuzzy automata with membership values in complete residuated lattices
- Fuzzy state grammar and fuzzy deep pushdown automaton
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
- Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness
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)
