Determinization of fuzzy automata via factorization of fuzzy states
From MaRDI portal
Publication:508600
DOI10.1016/J.INS.2014.06.033zbMATH Open1355.68158OpenAlexW2074853429MaRDI QIDQ508600FDOQ508600
Authors: José R. González de Mendívil, José R. Garitagoitia 
Publication date: 7 February 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.06.033
Recommendations
- Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
- Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure
- Brzozowski type determinization for fuzzy automata
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Further improvements of determinization methods for fuzzy finite automata
infinite rangedeterminizationfuzzy languagecontinuous triangular normfuzzy finite-state automatanon locally finite monoid
Cites Work
- Fuzzy sets
- Triangular norms
- A treatise on many-valued logics
- Handbook of weighted automata
- On fuzzy regular languages
- Determinism and fuzzy automata
- Formal power series and regular operations on fuzzy languages
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Fuzzy automata with \(\varepsilon\)-moves compute fuzzy measures between strings
- On the determinization of weighted finite automata
- Five Determinisation Algorithms
- Deterministic Acceptors of Regular Fuzzy Languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fuzzy languages
- An improved algorithm for determinization of weighted and fuzzy automata
- Maximin automata
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Approximate string matching using deformed fuzzy automata: a learning experience
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- On the recognizability of fuzzy languages. I
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Myhill-Nerode type theory for fuzzy languages and automata
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Determinization of weighted finite automata over strong bimonoids
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automata Theory with Modern Applications
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
Cited In (14)
- Dynamic logic assigned to automata
- On a factorized \(L\)-fuzzy automaton and its \(L\)-fuzzy topological characterization
- Brzozowski type determinization for fuzzy automata
- Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure
- On \(L\)-fuzzy automata, coalgebras and dialgebras: associated categories and \(L\)-fuzzy topologies
- Conditions for the existence of maximal factorizations
- Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
- Determinism and fuzzy automata
- Canonization of max-min fuzzy automata
- On the category of \(L\)-fuzzy automata, coalgebras and dialgebras
- Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences
- Determinization of fuzzy automata with membership values in complete residuated lattices
- A generalization of Myhill-Nerode theorem for fuzzy languages
- Further improvements of determinization methods for fuzzy finite automata
This page was built for publication: Determinization of fuzzy automata via factorization of fuzzy states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q508600)
