Automata theory based on complete residuated lattice-valued logic. II
From MaRDI portal
Publication:866002
zbMath1161.68549MaRDI QIDQ866002
Publication date: 20 February 2007
Published in: Science in China. Series F (Search for Journal in Brave)
Related Items (74)
TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES ⋮ Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure ⋮ Weak bisimulations for fuzzy automata ⋮ Brzozowski type determinization for fuzzy automata ⋮ Fuzzifying topological linear spaces ⋮ Equivalence in automata theory based on complete residuated lattice-valued logic ⋮ On intuitionistic fuzzy context-free languages ⋮ Interval type-2 fuzzy automata and interval type-2 fuzzy grammar ⋮ Similarity-based minimization of fuzzy tree automata ⋮ Unnamed Item ⋮ Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note ⋮ State hyperstructures of tree automata based on lattice-valued logic ⋮ Algebraic properties of complete residuated lattice valued tree automata ⋮ Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness ⋮ Automata theory based on quantum logic: Some characterizations ⋮ Fuzzy alternating Büchi automata over distributive lattices ⋮ Fuzzy grammar theory based on lattices ⋮ \(L^B\)-valued general fuzzy automata ⋮ On the category of \(L\)-fuzzy automata, coalgebras and dialgebras ⋮ On a factorized \(L\)-fuzzy automaton and its \(L\)-fuzzy topological characterization ⋮ 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 ⋮ Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders ⋮ Finite automata theory with membership values in lattices ⋮ Coding tree languages based on lattice-valued logic ⋮ Unnamed Item ⋮ Algebraic properties of \(L\)-fuzzy finite automata ⋮ Characterizations of fuzzy finite automata. ⋮ On a category of fuzzy automata with relations ⋮ Minimal realization for fuzzy behaviour: A bicategory-theoretic approach ⋮ Lattice-valued simulations for quantitative transition systems ⋮ FUZZY PREORDERED SET, FUZZY TOPOLOGY AND FUZZY AUTOMATON BASED ON GENERALIZED RESIDUATED LATTICE ⋮ Determinization of fuzzy automata with membership values in complete residuated lattices ⋮ DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA ⋮ GENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED ⋮ Determinization of fuzzy automata via factorization of fuzzy states ⋮ 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 ⋮ 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 ⋮ Myhill-Nerode type theory for fuzzy languages and automata ⋮ Unnamed Item ⋮ Fuzzy tree language recognizability ⋮ A probabilistic model of computing with words ⋮ Automata theory based on complete residuated lattice-valued logic: Reduction and minimization ⋮ The relationships among several types of fuzzy automata ⋮ Fuzzy relation equations and reduction of fuzzy automata ⋮ Reduction of fuzzy automata by means of fuzzy quasi-orders ⋮ On minimal realization of fuzzy behaviour and associated categories ⋮ Conditions for the existence of maximal factorizations ⋮ A categorical approach to minimal realization for a fuzzy language ⋮ The relationships among several forms of weighted finite automata over strong bimonoids ⋮ 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 ⋮ Fuzzy pushdown automata ⋮ ADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON ⋮ Lattice-Semigroups Tree Automation’s Congruence and Homomorphism ⋮ 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 ⋮ Grammar theory based on lattice-ordered monoid ⋮ Automata theory based on complete residuated lattice-valued logic: a categorical approach ⋮ Lattice-valued fuzzy Turing machines: computing power, universality and efficiency ⋮ Canonization of max-min fuzzy automata ⋮ Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids ⋮ 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 ⋮ Fuzzy Regular Languages Based on Residuated Lattice ⋮ Simulation for lattice-valued doubly labeled transition systems ⋮ Construction of a minimal realization and monoid for a fuzzy language: a categorical approach
This page was built for publication: Automata theory based on complete residuated lattice-valued logic. II
