Automata theory based on complete residuated lattice-valued logic: Pushdown automata

DOI10.1016/j.fss.2008.07.010zbMath1182.68108OpenAlexW2082157081WikidataQ62049432 ScholiaQ62049432MaRDI QIDQ1037929

Hongyan Xing, Fuchun Liu, 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.07.010

zbMATH Keywords

context-free grammarsnonclassical logiclanguagespushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Fuzzy logic; logic of vagueness (03B52) Grammars and rewriting systems (68Q42)

Related Items (24)

Weak bisimulations for fuzzy automata ⋮ Brzozowski type determinization for fuzzy automata ⋮ On intuitionistic fuzzy context-free languages ⋮ State hyperstructures of tree automata based on lattice-valued logic ⋮ 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 ⋮ Further improvements of determinization methods for fuzzy finite automata ⋮ 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 ⋮ 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• 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
• L-fuzzy grammars
• Metamathematics of fuzzy logic
• Fuzzy language on free monoid
• A probabilistic model of computing with words
• Algebraic aspects of families of fuzzy languages
• Equivalence in automata theory based on complete residuated lattice-valued logic
• Automata theory based on quantum logic: reversibilities and pushdown automata
• Fuzzy context-free languages. I: Generalized fuzzy context-free grammars
• Fuzzy context-free languages. II: Recognition and parsing algorithms
• On Fuzzy Logic I Many‐valued rules of inference
• Abstract residuation over lattices
• Residuated Lattices
• Fuzzy pushdown automata
• Fuzzy pushdown automata

This page was built for publication: Automata theory based on complete residuated lattice-valued logic: Pushdown automata