Pages that link to "Item:Q1759726"
From MaRDI portal
The following pages link to Characterizations of complete residuated lattice-valued finite tree automata (Q1759726):
Displaying 12 items.
- The universal fuzzy automaton (Q279373) (← links)
- Coding tree languages based on lattice-valued logic (Q1701899) (← links)
- On characterization of fuzzy tree pushdown automata (Q2001163) (← links)
- Lattice-valued tree pushdown automata: pumping lemma and closure properties (Q2076992) (← links)
- Characterization of tree automata based on quantum logic (Q2113952) (← links)
- Decidability of the minimization of fuzzy tree automata with membership values in complete lattices (Q2143812) (← links)
- Algebraic properties of complete residuated lattice valued tree automata (Q2392561) (← links)
- Similarity-based minimization of fuzzy tree automata (Q2634346) (← links)
- ON SOMEWHAT FUZZY AUTOMATA CONTINUOUS FUNCTIONS IN FUZZY AUTOMATA TOPOLOGICAL SPACES (Q4553401) (← links)
- State hyperstructures of tree automata based on lattice-valued logic (Q4553830) (← links)
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS (Q4626611) (← links)
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices (Q6154974) (← links)