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.014zbMATH Open1121.03048DBLPjournals/fss/Qiu06OpenAlexW2071188100WikidataQ62049464 ScholiaQ62049464MaRDI QIDQ853474FDOQ853474
Authors: Daowen Qiu 
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
Recommendations
- Pumping Lemma in context-free grammar 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: Pushdown automata
- A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata
- Automata theory based on quantum logic. II.
Formal languages and automata (68Q45) Many-valued logic (03B50) Fuzzy logic; logic of vagueness (03B52) Automata and formal grammars in connection with logical questions (03D05) General topics in artificial intelligence (68T01)
Cites Work
- Fuzzy sets and systems. Theory and applications
- On Fuzzy Logic I Many‐valued rules of inference
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear logic
- 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
- Title not available (Why is that?)
- Maximin automata
- 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?)
- Axiom schemes for m-valued propositions calculi
- Title not available (Why is that?)
- Abstract residuation over lattices
- Fuzzy discrete structures
- Title not available (Why is that?)
- Fuzzifying topology based on complete residuated lattice-valued logic. I
- Efficient simulation of finite automata by neural nets
Cited In (51)
- \(L\)-fuzzy automata theory: some characterizations via general fuzzy operators
- On \(L\)-fuzzy automata, coalgebras and dialgebras: associated categories and \(L\)-fuzzy topologies
- 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
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency
- 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
- Weak bisimulations for fuzzy automata
- ADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON
- Lattice-Semigroups Tree Automation’s Congruence and Homomorphism
- Fuzzy pushdown automata
- 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
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- Automata theory based on complete residuated lattice-valued logic. II
- 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
- Automata theory based on complete residuated lattice-valued logic: a categorical approach
- A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata
- Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
- 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
- Lattice-valued simulations for quantitative transition systems
- Formal power series and regular operations on fuzzy languages
- Fuzzy tree language recognizability
- Fuzzy multiset finite automata and their languages
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Determinization of fuzzy automata with membership values in complete residuated lattices
- TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
- On closure properties of \(\mathcal{L}\)-valued linear languages
- Nondeterministic fuzzy automata with membership values in complete residuated lattices
- Coding tree languages based on lattice-valued logic
- Similarity-based minimization of fuzzy tree automata
- Logical characterizations of simulation and bisimulation for fuzzy transition systems
- Fuzzy grammar theory based on lattices
- On intuitionistic fuzzy context-free languages
- Further improvements of determinization methods for fuzzy finite automata
- Grammar theory based on lattice-ordered monoid
This page was built for publication: Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853474)
