The following pages link to Fuzzy tree automata (Q2372277):
Displaying 22 items.
- A Büchi-like theorem for weighted tree automata over multioperator monoids (Q692910) (← links)
- Nondeterministic fuzzy automata (Q712503) (← links)
- Equational weighted tree transformations (Q766185) (← links)
- Algebras of fuzzy sets (Q1043291) (← links)
- Coding tree languages based on lattice-valued logic (Q1701899) (← links)
- Characterizations of complete residuated lattice-valued finite tree automata (Q1759726) (← links)
- On characterization of fuzzy tree pushdown automata (Q2001163) (← links)
- Principal abstract families of weighted tree languages (Q2064529) (← links)
- Lattice-valued tree pushdown automata: pumping lemma and closure properties (Q2076992) (← links)
- Characterization of tree automata based on quantum logic (Q2113952) (← links)
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids (Q2136289) (← links)
- Decidability of the minimization of fuzzy tree automata with membership values in complete lattices (Q2143812) (← links)
- Fuzzy tree language recognizability (Q2270250) (← links)
- Algebraic properties of complete residuated lattice valued tree automata (Q2392561) (← links)
- Syntactic recognizability of graphs with fuzzy attributes (Q2445984) (← links)
- Similarity-based minimization of fuzzy tree automata (Q2634346) (← 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)
- Lattice-Semigroups Tree Automation’s Congruence and Homomorphism (Q4982152) (← links)
- Synthesizing fuzzy tree automata (Q5088663) (← links)
- (Q5871579) (← links)
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices (Q6154974) (← links)
