Further improvements of determinization methods for fuzzy finite automata
From MaRDI portal
Abstract: In this paper we combine determinization and state reduction methods into two-in-one algorithms that simultaneously perform determinization and state reduction. These algorithms perform better than all previous determinization algorithms for fuzzy finite automata, developed by Belohlavek [Inform Sciences 143 (2002) 205-209], Li and Pedrycz [Fuzzy Set Syst 156 (2005) 68-92], Ignjatovi'c et al. [Inform Sciences 178 (2008) 164-180], and Janv{c}i'c et al. [Inform Sciences 181 (2011) 1358-1368], in the sense that they produce smaller automata, while require the same computation time. The only exception is the Brzozowski type determinization algorithm developed recently by Janv{c}i'c and 'Ciri'c [Fuzzy Set Syst (2014), to appear], which produces a minimal crisp-deterministic fuzzy automaton, but the algorithms created here can also be used within the Brzozowski type algorithm and improve its performances.
Recommendations
- Brzozowski type determinization for fuzzy automata
- Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
- Determinization of fuzzy automata with membership values in complete residuated lattices
- An improved algorithm for determinization of weighted and fuzzy automata
- Determinization of fuzzy automata via factorization of fuzzy states
Cites work
- scientific article; zbMATH DE number 1929949 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 1862743 (Why is no real title available?)
- scientific article; zbMATH DE number 6749347 (Why is no real title available?)
- scientific article; zbMATH DE number 2199279 (Why is no real title available?)
- scientific article; zbMATH DE number 2225808 (Why is no real title available?)
- Algorithms for Omega-Regular Games with Imperfect Information
- An improved algorithm for determinization of weighted and fuzzy automata
- Analysis and control of fuzzy discrete event systems using bisimulation equivalence
- Approximate string matching by fuzzy automata
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic: Pushdown automata
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Bisimulations for fuzzy automata
- Brzozowski type determinization for fuzzy automata
- Combinatorial Pattern Matching
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization
- Congruences and homomorphisms of fuzzy automata
- Decentralized supervisory control of fuzzy discrete event systems
- Determinism and fuzzy automata
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Determinization of weighted finite automata over strong bimonoids
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Finite \(L\)-fuzzy machines.
- Five Determinisation Algorithms
- Formal power series and regular operations on fuzzy languages
- Fuzzy automaton induction using neural network
- Fuzzy equational logic
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Fuzzy homomorphisms of algebras
- Fuzzy relation equations and reduction of fuzzy automata
- Mergible states in large NFA
- Minimal NFA Problems are Hard
- Minimization algorithm of fuzzy finite automata.
- Minimization of fuzzy finite automata
- Minimization of states in automata theory based on finite lattice-ordered monoids
- Myhill-Nerode type theory for fuzzy languages and automata
- NFA reduction algorithms by means of regular inequalities
- New directions in fuzzy automata
- Nonblocking check in fuzzy discrete event systems based on observation equivalence
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
- On quotient machines of a fuzzy automaton and the minimal machine
- POMDPs under probabilistic semantics
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- Qualitative analysis of partially-observable Markov decision processes
- Reducing NFAs by invariant equivalences.
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- The relationship of controllability between classical and fuzzy discrete-event systems
- Theory Is Forever
- Weak bisimulations for fuzzy automata
Cited in
(14)- Brzozowski type determinization for fuzzy automata
- Deformed fuzzy automata for the text error correction problem
- An improved algorithm for determinization of weighted and fuzzy automata
- New direction in fuzzy tree automata
- Weighted Automata over Vector Spaces
- Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
- New directions in fuzzy automata
- Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
- Characterization and computation of approximate bisimulations for fuzzy automata
- Weakly linear systems for matrices over the max-plus quantale
- Canonization of max-min fuzzy automata
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences
- Determinization of fuzzy automata via factorization of fuzzy states
This page was built for publication: Further improvements of determinization methods for fuzzy finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679810)
