The following pages link to (Q4899894):
Displaying 17 items.
- A Büchi-like theorem for weighted tree automata over multioperator monoids (Q692910) (← links)
- Weighted finite automata over strong bimonoids (Q845343) (← links)
- Weighted tree automata and weighted logics (Q860890) (← links)
- Determinization of weighted finite automata over strong bimonoids (Q991892) (← links)
- Characterizations of recognizable weighted tree languages by logic and bimorphisms (Q1797776) (← links)
- Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable (Q2040408) (← links)
- Kleene and Büchi theorems for weighted forest languages over M-monoids (Q2051789) (← links)
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids (Q2136289) (← links)
- Sequentiality of group-weighted tree automata (Q2232288) (← links)
- The relationships among several forms of weighted finite automata over strong bimonoids (Q2293180) (← links)
- The supports of weighted unranked tree automata (Q2805397) (← links)
- Weighted nested word automata and logics over strong bimonoids (Q2929640) (← links)
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics (Q3098032) (← links)
- DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA (Q3634180) (← links)
- Crisp-determinization of weighted tree automata over strong bimonoids (Q5038197) (← links)
- (Q5871579) (← links)
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices (Q6154974) (← links)
