Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
From MaRDI portal
Publication:853474
DOI10.1016/j.fss.2006.03.014zbMath1121.03048DBLPjournals/fss/Qiu06OpenAlexW2071188100WikidataQ62049464 ScholiaQ62049464MaRDI QIDQ853474
Publication date: 15 November 2006
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2006.03.014
Formal languages and automata (68Q45) Fuzzy logic; logic of vagueness (03B52) Automata and formal grammars in connection with logical questions (03D05) Many-valued logic (03B50) General topics in artificial intelligence (68T01)
Related Items (48)
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 ⋮ Equivalence in automata theory based on complete residuated lattice-valued logic ⋮ On intuitionistic fuzzy context-free languages ⋮ Similarity-based minimization of fuzzy tree automata ⋮ State hyperstructures of tree automata based on lattice-valued logic ⋮ Algebraic properties of complete residuated lattice valued tree automata ⋮ Fuzzy grammar theory based on lattices ⋮ 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 ⋮ 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 ⋮ Fuzzy multiset finite automata and their languages ⋮ Lattice-valued simulations for quantitative transition systems ⋮ Determinization of fuzzy automata with membership values in complete residuated lattices ⋮ GENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED ⋮ Logical characterizations of simulation and bisimulation for fuzzy transition systems ⋮ 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 ⋮ 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 ⋮ Formal power series and regular operations on fuzzy languages ⋮ Fuzzy tree language recognizability ⋮ Automata theory based on complete residuated lattice-valued logic: Reduction and minimization ⋮ Fuzzy relation equations and reduction of fuzzy automata ⋮ Reduction of fuzzy automata by means of fuzzy quasi-orders ⋮ 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 ⋮ Categories of Automata and Languages Based on a Complete Residuated Lattice ⋮ Simulation for lattice-valued doubly labeled transition systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Fuzzy sets and systems. Theory and applications
- Fuzzifying topology based on complete residuated lattice-valued logic. I
- On Fuzzy Logic I Many‐valued rules of inference
- On Fuzzy Logic II. Enriched residuated lattices and semantics of propositional calculi
- On Fuzzy Logic III. Semantical completeness of some many‐valued propositional calculi
- Deterministic Acceptors of Regular Fuzzy Languages
- Efficient simulation of finite automata by neural nets
- Maximin automata
- Abstract residuation over lattices
- Axiom schemes for m-valued propositions calculi
- Fuzzy discrete structures
This page was built for publication: Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
