Lattice-valued tree pushdown automata: pumping lemma and closure properties

DOI10.1016/J.IJAR.2021.12.002MaRDI QIDQ2076992zbMATH OpenOpenAlexWikidataFDO

Authors M. Ghorani, Sunita Garhwal, Somaye Moghari

Publication date 22 February 2022

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2021.12.002

zbMATH Keywords

pumping lemmaclosure propertieslattice-valued context-free tree languagelattice-valued tree pushdown automata

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Coding tree languages based on lattice-valued logic
• Pushdown automata and context-free grammars based on complete residuated lattice-valued logic
• Automata theory based on complete residuated lattice-valued logic: Pushdown automata
• Characterizations of complete residuated lattice-valued finite tree automata
• scientific article; zbMATH DE number 2094809

Cites work

• scientific article; zbMATH DE number 3729448 (Why is no real title available?)
• scientific article; zbMATH DE number 512856 (Why is no real title available?)
• Algebraic properties of complete residuated lattice valued tree automata
• Automata for XML -- a survey
• Automata theory based on complete residuated lattice-valued logic: Pushdown automata
• Characterizations of complete residuated lattice-valued finite tree automata
• Coding tree languages based on lattice-valued logic
• Computation tree logic model checking based on possibility measures
• Deterministic tree pushdown automata and monadic tree rewriting systems
• Fuzzy alternating Büchi automata over distributive lattices
• Fuzzy pushdown automata
• Fuzzy state grammar and fuzzy deep pushdown automaton
• Fuzzy tree automata
• Fuzzy tree language recognizability
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Grammatical picture generation. A tree-based approach. With CD-ROM.
• Model checking computation tree logic over finite lattices
• New directions in fuzzy automata
• Nondeterministic fuzzy automata with membership values in complete residuated lattices
• On characterization of fuzzy tree pushdown automata
• On intuitionistic fuzzy context-free languages
• Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic
• Pushdown tree automata
• Similarity-based minimization of fuzzy tree automata
• TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
• Tree pushdown automata

Cited in

(4)

• General-nondeterministic fuzzy pushdown automata and their languages
• Isomorphism between two vector general fuzzy automata
• Synthesizing fuzzy tree automata
• Pumping lemmas can be ``harmful

This page was built for publication: Lattice-valued tree pushdown automata: pumping lemma and closure properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2076992)