Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
From MaRDI portal
Publication:983034
DOI10.1016/j.fss.2009.12.011zbMath1192.68426OpenAlexW2089476904WikidataQ62049421 ScholiaQ62049421MaRDI QIDQ983034
Publication date: 28 July 2010
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2009.12.011
finite automataresiduated latticesnon-classical logicfuzzy regular languagesreduction and minimization
Related Items
IT-2 Fuzzy Automata and IT-2 Fuzzy Languages, Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure, The universal fuzzy automaton, Weak bisimulations for fuzzy automata, Brzozowski type determinization for fuzzy automata, Decidability of the minimization of fuzzy tree automata with membership values in complete lattices, Unnamed Item, State hyperstructures of tree automata based on lattice-valued logic, Algebraic properties of complete residuated lattice valued tree automata, On the category of \(L\)-fuzzy automata, coalgebras and dialgebras, On a factorized \(L\)-fuzzy automaton and its \(L\)-fuzzy topological characterization, On closure properties of \(\mathcal{L}\)-valued linear languages, On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations, Fuzzy automata based on lattice-ordered monoid with algebraic and topological aspects, Bisimulations for fuzzy automata, Coding tree languages based on lattice-valued logic, On minimal realization for a fuzzy language and Brzozowski’s algorithm, Minimal realization for fuzzy behaviour: A bicategory-theoretic approach, FUZZY PREORDERED SET, FUZZY TOPOLOGY AND FUZZY AUTOMATON BASED ON GENERALIZED RESIDUATED LATTICE, GENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED, Determinization of fuzzy automata via factorization of fuzzy states, Further improvements of determinization methods for fuzzy finite automata, Nondeterministic fuzzy automata with membership values in complete residuated lattices, Computation of the greatest simulations and bisimulations between fuzzy automata, Construction of fuzzy automata from fuzzy regular expressions, Characterizations of complete residuated lattice-valued finite tree automata, A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata, Unnamed Item, Reduction of fuzzy automata by means of fuzzy quasi-orders, On minimal realization of fuzzy behaviour and associated categories, A categorical approach to minimal realization for a fuzzy language, Weighted finite automata with output, Categories of quantale-valued fuzzy automata: determinization and minimization, On \(L^M\)-valued automata: an operator oriented view, TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS, ADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON, Categories of Automata and Languages Based on a Complete Residuated Lattice, Different Operators in Automata Theory Based on Residuated and Co-Residuated Lattices, Bipolar Fuzzy Preorder, Alexandrov Bipolar Fuzzy Topology and Bipolar Fuzzy Automata, Measure of Operators Associated with Fuzzy Automata, Simulation for lattice-valued doubly labeled transition systems, Construction of a minimal realization and monoid for a fuzzy language: a categorical approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
- The equivalence between fuzzy Mealy and fuzzy Moore machines
- Minimization of states in automata theory based on finite lattice-ordered monoids
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization
- A note on Trillas' CHC models
- Behaviour, reduction and minimization of finite \({\mathbb{L}}\)-automata
- Equivalence, reduction and minimization of finite fuzzy-automata
- Equivalence, reduction and minimization of finite automata over semirings
- Metamathematics of fuzzy logic
- Fuzzifying topology based on complete residuated lattice-valued logic. I
- On quotient machines of a fuzzy automaton and the minimal machine
- Characterizations of fuzzy finite automata.
- Finite \(L\)-fuzzy machines.
- Minimization algorithm of fuzzy finite automata.
- New directions in fuzzy automata
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Minimization of lattice finite automata and its application to the decomposition of lattice languages
- Infinite fuzzy computations
- Determinization of fuzzy automata with membership values in complete residuated lattices
- A categorical approach to lattice-valued fuzzy automata
- The relationships among several types of fuzzy automata
- Toward a generalized theory of uncertainty (GTU) -- an outline
- A formal power series approach to the construction of minimal fuzzy automata
- On Fuzzy Logic I Many‐valued rules of inference
- Maximin automata
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Abstract residuation over lattices
- Axiom schemes for m-valued propositions calculi
- Fuzzy discrete structures
