Pages that link to "Item:Q2429720"

The following pages link to Weighted logics for unranked tree automata (Q2429720):

Displaying 20 items.

• Weighted automata and logics for infinite nested words (Q515684) (← 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)
• Weighted automata and weighted logics with discounting (Q840767) (← links)
• Definable transductions and weighted logics for texts (Q844894) (← 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)
• Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483) (← links)
• Weighted automata (Q2074206) (← links)
• A logic-based approach to incremental reasoning on multi-agent systems (Q2089459) (← 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)
• The Supports of Weighted Unranked Tree Automata (Q2805397) (← links)
• Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics (Q2947150) (← links)
• Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics (Q3098032) (← links)
• Pebble Weighted Automata and Weighted Logics (Q5169971) (← links)
• Effective optimization with weighted automata on decomposable trees (Q5413875) (← links)
• A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings (Q6137852) (← links)
• Weighted automata and logics meet computational complexity (Q6647756) (← links)
• A Nivat theorem for weighted alternating automata over commutative semirings (Q6649528) (← links)