Pages that link to "Item:Q2270250"
From MaRDI portal
The following pages link to Fuzzy tree language recognizability (Q2270250):
Displaying 16 items.
- Brzozowski type determinization for fuzzy automata (Q279377) (← links)
- An improved algorithm for determinization of weighted and fuzzy automata (Q543822) (← links)
- Determinization of weighted finite automata over strong bimonoids (Q991892) (← 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)
- Lattice-valued tree pushdown automata: pumping lemma and closure properties (Q2076992) (← 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)
- Syntactic recognizability of graphs with fuzzy attributes (Q2445984) (← links)
- Similarity-based minimization of fuzzy tree automata (Q2634346) (← links)
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics (Q3098032) (← 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)
- Synthesizing fuzzy tree automata (Q5088663) (← links)
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices (Q6154974) (← links)