The universal fuzzy automaton
From MaRDI portal
Publication:279373
DOI10.1016/j.fss.2013.08.002zbMath1334.68123OpenAlexW2062087069MaRDI QIDQ279373
Publication date: 28 April 2016
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2013.08.002
Related Items (12)
Unnamed Item ⋮ On the category of \(L\)-fuzzy automata, coalgebras and dialgebras ⋮ On a factorized \(L\)-fuzzy automaton and its \(L\)-fuzzy topological characterization ⋮ Fuzzy \(\epsilon\)-approximate regular languages and minimal deterministic fuzzy automata \(\epsilon\)-accepting them ⋮ A fuzzy modal logic for fuzzy transition systems ⋮ Approximate bisimulations and state reduction of fuzzy automata under fuzzy similarity measures ⋮ Algebraic and topological structures on factorizations of fuzzy sets1 ⋮ DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA ⋮ Rough fuzzy bipolar soft sets and application in decision-making problems ⋮ A categorical approach to minimal realization for a fuzzy language ⋮ Approximate bisimulation relations for fuzzy automata ⋮ TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bisimulations for fuzzy automata
- Finite automata theory with membership values in lattices
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Congruences and homomorphisms of fuzzy automata
- Handbook of weighted automata
- Minimization of states in automata theory based on finite lattice-ordered monoids
- Automata theory based on complete residuated lattice-valued logic
- Universal automata and NFA learning
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Fuzzy relation equations and reduction of fuzzy automata
- Metamathematics of fuzzy logic
- Characterizations of complete residuated lattice-valued finite tree automata
- Minimization of fuzzy finite automata
- Determinism and fuzzy automata
- Formal power series and regular operations on fuzzy languages
- Minimization of lattice finite automata and its application to the decomposition of lattice languages
- Determinization of fuzzy automata with membership values in complete residuated lattices
- MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON
This page was built for publication: The universal fuzzy automaton