Equivalence in automata theory based on complete residuated lattice-valued logic
From MaRDI portal
Publication:2372274
DOI10.1016/J.FSS.2007.01.008zbMATH Open1152.68463OpenAlexW2018492626WikidataQ62049458 ScholiaQ62049458MaRDI QIDQ2372274FDOQ2372274
Authors: Hongyan Xing, Fuchun Liu, Zhujun Fan, Daowen Qiu 
Publication date: 26 July 2007
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2007.01.008
Recommendations
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Automata theory based on complete residuated lattice-valued logic. II
- Automata theory based on complete residuated lattice-valued logic: Turing machines
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic: a categorical approach
equivalencefuzzy languagesnonclassical logicfuzzy finite automatasequential machinesresiduated lattice-valued logic
Formal languages and automata (68Q45) Fuzzy logic; logic of vagueness (03B52) Automata and formal grammars in connection with logical questions (03D05)
Cites Work
- Title not available (Why is that?)
- On Fuzzy Logic I Many‐valued rules of inference
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fuzzy automata and languages
- On fuzzy regular languages
- Finite \(L\)-fuzzy machines.
- Minimization of fuzzy finite automata
- Max-product machines
- Resolution of composite fuzzy relation equations
- Deterministic Acceptors of Regular Fuzzy Languages
- Title not available (Why is that?)
- Maximin automata
- 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
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reduced forms for stochastic sequential machines
- Fuzzy discrete structures
- Fuzzy language on free monoid
- On reductions of maximin machines
- Equivalence, reduction and minimization of finite fuzzy-automata
- Equivalence, reduction and minimization of finite automata over semirings
- Title not available (Why is that?)
- Comments on the Minimization of Stochastic Machines
Cited In (38)
- Algebraic properties of complete residuated lattice valued tree automata
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- Bisimulations for fuzzy automata
- Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure
- 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
- Automata theory based on complete residuated lattice-valued logic: Turing machines
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- Automata theory based on complete residuated lattice-valued logic. II
- Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization
- Myhill-Nerode type theory for fuzzy languages and automata
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- Fuzzy relation equations and reduction of fuzzy automata
- Automata theory based on complete residuated lattice-valued logic: Pushdown automata
- Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic
- On minimal realization of fuzzy behaviour and associated categories
- Automata theory based on complete residuated lattice-valued logic: a categorical approach
- 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?)
- Minimal realization for fuzzy behaviour: a bicategory-theoretic approach
- Categories of quantale-valued fuzzy automata: determinization and minimization
- A categorical approach to minimal realization for a fuzzy language
- Weighted finite automata with output
- Formal power series and regular operations on fuzzy languages
- Fuzzy automata based on lattice-ordered monoid with algebraic and topological aspects
- Determinization of fuzzy automata with membership values in complete residuated lattices
- 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
- Coding tree languages based on lattice-valued logic
- Further improvements of determinization methods for fuzzy finite automata
- Grammar theory based on lattice-ordered monoid
This page was built for publication: Equivalence in automata theory based on complete residuated lattice-valued logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372274)
