Lattice-valued tree pushdown automata: pumping lemma and closure properties
From MaRDI portal
Publication:2076992
DOI10.1016/J.IJAR.2021.12.002OpenAlexW4200019305WikidataQ124985066 ScholiaQ124985066MaRDI QIDQ2076992FDOQ2076992
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
pumping lemmaclosure propertieslattice-valued context-free tree languagelattice-valued tree pushdown automata
Cites Work
- Title not available (Why is that?)
- Automata for XML -- a survey
- 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
- Characterizations of complete residuated lattice-valued finite tree automata
- Fuzzy tree language recognizability
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Nondeterministic fuzzy automata with membership values in complete residuated lattices
- Computation tree logic model checking based on possibility measures
- Deterministic tree pushdown automata and monadic tree rewriting systems
- Pushdown tree automata
- New directions in fuzzy automata
- Fuzzy tree automata
- Fuzzy pushdown automata
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- Grammatical picture generation. A tree-based approach. With CD-ROM.
- Model checking computation tree logic over finite lattices
- Tree pushdown automata
- Title not available (Why is that?)
- Fuzzy state grammar and fuzzy deep pushdown automaton
- Fuzzy alternating Büchi automata over distributive lattices
- Coding tree languages based on lattice-valued logic
- Algebraic properties of complete residuated lattice valued tree automata
- Similarity-based minimization of fuzzy tree automata
- On characterization of fuzzy tree pushdown automata
- On intuitionistic fuzzy context-free languages
Cited In (4)
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)
