Characterizations of complete residuated lattice-valued finite tree automata
From MaRDI portal
Publication:1759726
DOI10.1016/j.fss.2011.11.010zbMath1253.68203OpenAlexW1986566706MaRDI QIDQ1759726
Publication date: 22 November 2012
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2011.11.010
homomorphismformal languagestree automatapumping lemmaminimization algorithm\(L\)-valued regular tree languages
Related Items
The universal fuzzy automaton, Decidability of the minimization of fuzzy tree automata with membership values in complete lattices, Similarity-based minimization of fuzzy tree automata, State hyperstructures of tree automata based on lattice-valued logic, Algebraic properties of complete residuated lattice valued tree automata, A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices, Coding tree languages based on lattice-valued logic, ON SOMEWHAT FUZZY AUTOMATA CONTINUOUS FUNCTIONS IN FUZZY AUTOMATA TOPOLOGICAL SPACES, On characterization of fuzzy tree pushdown automata, TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS, Lattice-valued tree pushdown automata: pumping lemma and closure properties, Characterization of tree automata based on quantum logic
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
- Minimization of states in automata theory based on finite lattice-ordered monoids
- Automata theory based on complete residuated lattice-valued logic
- Automata theory based on complete residuated lattice-valued logic. II
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
- A note on Trillas' CHC models
- 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 fuzzy finite automata.
- Minimization algorithm of fuzzy finite automata.
- Fuzzy tree language recognizability
- Equivalence in automata theory based on complete residuated lattice-valued logic
- Minimization of lattice finite automata and its application to the decomposition of lattice languages
- Fuzzy tree automata
- Weak Second‐Order Arithmetic and Finite Automata
- On Fuzzy Logic I Many‐valued rules of inference
- On Fuzzy Logic II. Enriched residuated lattices and semantics of propositional calculi
- On Fuzzy Logic III. Semantical completeness of some many‐valued propositional calculi
- Axiom schemes for m-valued propositions calculi
- Fuzzy discrete structures
