The following pages link to (Q4076799):
Displaying 10 items.
- A Büchi-like theorem for weighted tree automata over multioperator monoids (Q692910) (← links)
- Coding tree languages based on lattice-valued logic (Q1701899) (← links)
- Characterizations of complete residuated lattice-valued finite tree automata (Q1759726) (← 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 automata (Q2372277) (← links)
- State hyperstructures of tree automata based on lattice-valued logic (Q4553830) (← links)
- Lattice-Semigroups Tree Automation’s Congruence and Homomorphism (Q4982152) (← links)
- (Q5871579) (← links)
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices (Q6154974) (← links)
