Characterizations of fuzzy finite automata.
From MaRDI portal
Publication:1426246
DOI10.1016/S0165-0114(03)00202-1zbMath1059.68069OpenAlexW2084972071WikidataQ62049467 ScholiaQ62049467MaRDI QIDQ1426246
Publication date: 14 March 2004
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0165-0114(03)00202-1
Related Items
Weak bisimulations for fuzzy automata, A diagnoser algorithm for anomaly detection in DEDS under partial and unreliable observations: characterization and inclusion in sensor configuration optimization, Decidability of the minimization of fuzzy tree automata with membership values in complete lattices, Fuzzification of strongly and locally strongly compact spaces, State hyperstructures of tree automata based on lattice-valued logic, Algebraic properties of complete residuated lattice valued tree automata, Minimization of states in automata theory based on finite lattice-ordered monoids, New directions in LB-valued general fuzzy automata: A topological view, \(L^B\)-valued general fuzzy automata, On a factorized \(L\)-fuzzy automaton and its \(L\)-fuzzy topological characterization, Fuzzy automata based on lattice-ordered monoid with algebraic and topological aspects, \(\alpha \)-irresoluteness and \(\alpha \)-compactness based on continuous valued logic, Bisimulations for fuzzy automata, Coding tree languages based on lattice-valued logic, Algebraic properties of \(L\)-fuzzy finite automata, On a category of fuzzy automata with relations, FUZZY PREORDERED SET, FUZZY TOPOLOGY AND FUZZY AUTOMATON BASED ON GENERALIZED RESIDUATED LATTICE, Determinization of fuzzy automata with membership values in complete residuated lattices, Logical characterizations of simulation and bisimulation for fuzzy transition systems, On equality between fuzzy context-free and fuzzy adult 0L languages, Nondeterministic fuzzy automata with membership values in complete residuated lattices, Computation of the greatest simulations and bisimulations between fuzzy automata, Automata theory based on complete residuated lattice-valued logic: Turing machines, On characterization of fuzzy tree pushdown automata, Construction of fuzzy automata from fuzzy regular expressions, Characterizations of complete residuated lattice-valued finite tree automata, Unnamed Item, Locally \(\alpha\)-compact spaces based on continuous valued logic, Fuzzy tree language recognizability, Nondeterministic fuzzy automata, Automata theory based on complete residuated lattice-valued logic: Reduction and minimization, The relationships among several types of fuzzy automata, Reduction of fuzzy automata by means of fuzzy quasi-orders, On \(L^M\)-valued automata: an operator oriented view, ADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON, Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic, Grammar theory based on lattice-ordered monoid, Lattice-valued fuzzy Turing machines: computing power, universality and efficiency, Categories of Automata and Languages Based on a Complete Residuated Lattice, Different Operators in Automata Theory Based on Residuated and Co-Residuated Lattices, Measure of Operators Associated with Fuzzy Automata
Cites Work
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Semantic analysis of inductive reasoning
- Fuzzy topological spaces and fuzzy compactness
- Products of fuzzy finite state machines
- A fuzzy topology associated with a fuzzy finite state machine
- On fuzzy regular languages
- Minimization of fuzzy finite automata
- On subsystems of a fuzzy finite state machine
- A new approach for fuzzy topology. I
- On Fuzzy Logic III. Semantical completeness of some many‐valued propositional calculi
- A topology for automata: A note
- Application of model theoretic games to discrete linear orders and finite automata
- Efficient simulation of finite automata by neural nets
- Maximin automata
- Axiom schemes for m-valued propositions calculi
- Fuzzy discrete structures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
