Pages that link to "Item:Q860890"
From MaRDI portal
The following pages link to Weighted tree automata and weighted logics (Q860890):
Displayed 39 items.
- Weighted automata and logics for infinite nested words (Q515684) (← links)
- MSO logics for weighted timed automata (Q548692) (← links)
- A Büchi-like theorem for weighted tree automata over multioperator monoids (Q692910) (← links)
- Weighted automata and multi-valued logics over arbitrary bounded lattices (Q764336) (← links)
- A note on cut-worthiness of recognizable tree series (Q835283) (← links)
- Weighted automata and weighted logics with discounting (Q840767) (← links)
- Weighted automata and weighted logics on infinite words (Q845080) (← links)
- Weighted monadic Datalog (Q944376) (← links)
- Characterizations of recognizable weighted tree languages by logic and bimorphisms (Q1797776) (← links)
- A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties (Q1797777) (← links)
- Weighted automata and weighted MSO logics for average and long-time behaviors (Q1932173) (← links)
- Kleene and Büchi theorems for weighted forest languages over M-monoids (Q2051789) (← links)
- Weighted operator precedence languages (Q2064530) (← links)
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids (Q2136289) (← links)
- Characterizing weighted MSO for trees by branching transitive closure logics (Q2355685) (← links)
- A link between multioperator and tree valuation automata and logics (Q2355687) (← links)
- Weighted automata and weighted logics (Q2373736) (← links)
- Weighted logics for unranked tree automata (Q2429720) (← links)
- Weighted picture automata and weighted logics (Q2429722) (← links)
- A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic (Q2799219) (← links)
- Weighted Automata and Logics on Infinite Graphs (Q2817384) (← links)
- On Finite and Polynomial Ambiguity of Weighted Tree Automata (Q2817402) (← links)
- Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics (Q2947150) (← links)
- Learning Tree Languages (Q2963598) (← links)
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics (Q3098032) (← links)
- Weighted Automata and Weighted Logics with Discounting (Q3503896) (← links)
- Weighted Logics for Nested Words and Algebraic Formal Power Series (Q3519504) (← links)
- Automatic Termination (Q3636815) (← links)
- Weighted versus Probabilistic Logics (Q3637211) (← links)
- Weighted Timed MSO Logics (Q3637244) (← links)
- (Q4558788) (← links)
- Crisp-determinization of weighted tree automata over strong bimonoids (Q5038197) (← links)
- Weighted Automata and Weighted Logics (Q5072547) (← links)
- (Q5092440) (← links)
- Weighted Operator Precedence Languages (Q5111245) (← links)
- Pebble Weighted Automata and Weighted Logics (Q5169971) (← links)
- (Q5871579) (← links)
- A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings (Q6137852) (← links)
- A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices (Q6154974) (← links)