Pages that link to "Item:Q1090465"

The following pages link to Weighted grammars and Kleene's theorem (Q1090465):

Displaying 31 items.

• A Büchi-like theorem for weighted tree automata over multioperator monoids (Q692910) (← links)
• Equational weighted tree transformations (Q766185) (← links)
• A note on cut-worthiness of recognizable tree series (Q835283) (← links)
• Weighted monadic Datalog (Q944376) (← links)
• On two families of forests (Q1323385) (← links)
• A Kleene theorem for weighted tree automata (Q1764423) (← links)
• Characterizations of recognizable weighted tree languages by logic and bimorphisms (Q1797776) (← links)
• Finite sequentiality of unambiguous max-plus tree automata (Q2048206) (← links)
• Principal abstract families of weighted tree languages (Q2064529) (← links)
• Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids (Q2136289) (← links)
• Approximated determinisation of weighted tree automata (Q2232287) (← links)
• Sequentiality of group-weighted tree automata (Q2232288) (← links)
• A Kleene theorem for weighted tree automata over tree valuation monoids (Q2280327) (← links)
• Weighted logics for unranked tree automata (Q2429720) (← links)
• Weighted grammar tools: The GRM library (Q2776250) (← links)
• Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics (Q3098032) (← links)
• Equational Weighted Tree Transformations with Discounting (Q3098036) (← links)
• Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition (Q3098043) (← links)
• Valuations of Weighted Automata: Doing It in a Rational Way (Q3098044) (← links)
• Weighted Deductive Parsing and Knuth's Algorithm (Q3225400) (← links)
• Nonassociativity à la Kleene (Q3522872) (← links)
• DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA (Q3634180) (← links)
• -Treeautomata and their relation to weighted context-free grammars (Q3816997) (← links)
• (Q4449539) (← links)
• Crisp-determinization of weighted tree automata over strong bimonoids (Q5038197) (← links)
• (Q5871579) (← links)
• Fundamentals of Computation Theory (Q5900814) (← links)
• An ambiguity hierarchy of weighted context-free grammars (Q6049933) (← links)
• A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices (Q6154974) (← links)
• Finite sequentiality of finitely ambiguous max-plus tree automata (Q6614608) (← links)
• Rational weighted tree languages with storage (Q6647747) (← links)