Brzozowski type determinization for fuzzy automata
From MaRDI portal
Abstract: In this paper we adapt the well-known Brzozowski determinization method to fuzzy automata. This method gives better results than all previously known methods for determinization of fuzzy automata developed by Bv{e}lohl'avek [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]. Namely, as in the case of ordinary nondeterministic automata, Brzozowski type determinization of a fuzzy automaton results in a minimal crisp-deterministic fuzzy automaton equivalent to the starting fuzzy automaton, and we show that there are cases when all previous methods result in infinite automata, while Brzozowski type determinization results in a finite one. The paper deals with fuzzy automata over complete residuated lattices, but identical results can also be obtained in a more general context, for fuzzy automata over lattice-ordered monoids, and even for weighted automata over commutative semirings.
Recommendations
- Further improvements of determinization methods for fuzzy finite automata
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
- Canonization of max-min fuzzy automata
- Determinization of fuzzy automata via factorization of fuzzy states
Cites work
- scientific article; zbMATH DE number 3623470 (Why is no real title available?)
- scientific article; zbMATH DE number 798342 (Why is no real title available?)
- scientific article; zbMATH DE number 2199279 (Why is no real title available?)
- scientific article; zbMATH DE number 6300100 (Why is no real title available?)
- scientific article; zbMATH DE number 3189697 (Why is no real title available?)
- An improved algorithm for determinization of weighted and fuzzy automata
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Automata theory based on complete residuated lattice-valued logic: Pushdown automata
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Determinism and fuzzy automata
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Determinization of weighted finite automata over strong bimonoids
- Elements of automata theory. Translated from the French by Reuben Thomas
- Experimental Evaluation of Classical Automata Constructions
- Five Determinisation Algorithms
- Formal power series and regular operations on fuzzy languages
- 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
- Fuzzy tree language recognizability
- Minimization of lattice finite automata and its application to the decomposition of lattice languages
- Myhill-Nerode type theory for fuzzy languages and automata
- On approximate minimization of fuzzy automata
- On the recognizability of fuzzy languages. I
- On the recognizability of fuzzy languages. II
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- Reduction of fuzzy automata by means of fuzzy quasi-orders
Cited in
(15)- Interval type-2 fuzzy automata and interval type-2 fuzzy grammar
- Weak bisimulations for fuzzy automata
- An improved algorithm for determinization of weighted and fuzzy automata
- Weighted Automata over Vector Spaces
- TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
- Further improvements of determinization methods for fuzzy finite automata
- scientific article; zbMATH DE number 7317445 (Why is no real title available?)
- Determinism and fuzzy automata
- Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
- A categorical approach to minimal realization for a fuzzy language
- Canonization of max-min fuzzy automata
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Determinization of fuzzy automata via factorization of fuzzy states
- On minimal realization for a fuzzy language and Brzozowski's algorithm
- Minimal realization for fuzzy behaviour: a bicategory-theoretic approach
This page was built for publication: Brzozowski type determinization for fuzzy automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q279377)
