Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic

DOI10.1016/J.FSS.2008.06.016zbMath1187.68305OpenAlexW2010658783WikidataQ62049442 ScholiaQ62049442MaRDI QIDQ1037930

Hongyan Xing, Dao Wen Qiu

Publication date: 17 November 2009

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.fss.2008.06.016

zbMATH Keywords

context-free languagesnon-classical logicpumping Lemma

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (22)

Weak bisimulations for fuzzy automata ⋮ On intuitionistic fuzzy context-free languages ⋮ Algebraic properties of complete residuated lattice valued tree automata ⋮ 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 ⋮ Coding tree languages based on lattice-valued logic ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata ⋮ On characterization of fuzzy tree pushdown automata ⋮ 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 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 ⋮ ADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON ⋮ Lattice-valued tree pushdown automata: pumping lemma and closure properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A note on Trillas' CHC models
• Fuzzy sets and systems. Theory and applications
• L-fuzzy grammars
• Fuzzifying topology based on complete residuated lattice-valued logic. I
• On fuzzy regular languages
• Characterizations of fuzzy finite automata.
• Equivalence in automata theory based on complete residuated lattice-valued logic
• On Fuzzy Logic I Many‐valued rules of inference
• Axiom schemes for m-valued propositions calculi
• Fuzzy discrete structures

This page was built for publication: Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic