Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
From MaRDI portal
Publication:983034
DOI10.1016/J.FSS.2009.12.011zbMATH Open1192.68426OpenAlexW2089476904WikidataQ62049421 ScholiaQ62049421MaRDI QIDQ983034FDOQ983034
Authors: Lihua Wu, Daowen Qiu 
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
Recommendations
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Minimization of states in automata theory based on finite lattice-ordered monoids
- Automata theory based on complete residuated lattice-valued logic: a categorical approach
finite automataresiduated latticesnon-classical logicfuzzy regular languagesreduction and minimization
Cites Work
- On Fuzzy Logic I Many‐valued rules of inference
- Metamathematics of fuzzy logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear logic
- A note on Trillas' CHC models
- Characterizations of fuzzy finite automata.
- Finite \(L\)-fuzzy machines.
- 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
- Determinization of fuzzy automata with membership values in complete residuated lattices
- Toward a generalized theory of uncertainty (GTU) -- an outline
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximin automata
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- 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
- 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
- On quotient machines of a fuzzy automaton and the minimal machine
- The relationships among several types of fuzzy automata
- Axiom schemes for m-valued propositions calculi
- Minimization algorithm of fuzzy finite automata.
- A categorical approach to lattice-valued fuzzy automata
- Fuzzification of rational and recognizable sets
- The equivalence between fuzzy Mealy and fuzzy Moore machines
- Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization
- Abstract residuation over lattices
- Fuzzy discrete structures
- Title not available (Why is that?)
- New directions in fuzzy automata
- Fuzzifying topology based on complete residuated lattice-valued logic. I
- 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
- Infinite fuzzy computations
- A formal power series approach to the construction of minimal fuzzy automata
Cited In (48)
- Simulation for lattice-valued doubly labeled transition systems
- Algebraic properties of complete residuated lattice valued tree automata
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- GENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED
- Bisimulations for fuzzy 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
- The universal fuzzy automaton
- Weak bisimulations for fuzzy automata
- ADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON
- On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
- Finite automata theory with membership values in lattices
- Automata theory based on complete residuated lattice-valued logic: Turing machines
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Categories of Automata and Languages Based on a Complete Residuated Lattice
- Bipolar Fuzzy Preorder, Alexandrov Bipolar Fuzzy Topology and Bipolar Fuzzy Automata
- Measure of Operators Associated with Fuzzy Automata
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- Different Operators in Automata Theory Based on Residuated and Co-Residuated Lattices
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Minimization of states in automata theory based on finite lattice-ordered monoids
- On minimal realization of fuzzy behaviour and associated categories
- Decidability of the minimization of fuzzy tree automata with membership values in complete lattices
- A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata
- Characterizations of complete residuated lattice-valued finite tree automata
- Construction of fuzzy automata from fuzzy regular expressions
- State hyperstructures of tree automata based on lattice-valued logic
- Title not available (Why is that?)
- On the category of \(L\)-fuzzy automata, coalgebras and dialgebras
- On minimal realization for a fuzzy language and Brzozowski's algorithm
- Minimal realization for fuzzy behaviour: a bicategory-theoretic approach
- Minimal fuzzy realization for fuzzy behaviour: a bicategory-theoretic approach
- Categories of quantale-valued fuzzy automata: determinization and minimization
- On \(L^M\)-valued automata: an operator oriented view
- A categorical approach to minimal realization for a fuzzy language
- Weighted finite automata with output
- IT-2 Fuzzy Automata and IT-2 Fuzzy Languages
- Fuzzy automata based on lattice-ordered monoid with algebraic and topological aspects
- Equivalence in automata theory based on complete residuated lattice-valued logic
- FUZZY PREORDERED SET, FUZZY TOPOLOGY AND FUZZY AUTOMATON BASED ON GENERALIZED RESIDUATED LATTICE
- Construction of a minimal realization and monoid for a fuzzy language: a categorical approach
- On closure properties of \(\mathcal{L}\)-valued linear languages
- Determinization of fuzzy automata via factorization of fuzzy states
- Nondeterministic fuzzy automata with membership values in complete residuated lattices
- Coding tree languages based on lattice-valued logic
- Further improvements of determinization methods for fuzzy finite automata
This page was built for publication: Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q983034)
