Pages that link to "Item:Q5072551"

The following pages link to Weighted Tree Automata and Tree Transducers (Q5072551):

Displaying 45 items.

• Simulation relations for pattern matching in directed graphs (Q388784) (← links)
• Compositions of constant weighted extended tree transducers (Q832923) (← links)
• Weighted tree automata and weighted logics (Q860890) (← links)
• The generative power of delegation networks (Q897662) (← links)
• Characterizations of recognizable weighted tree languages by logic and bimorphisms (Q1797776) (← links)
• Finite sequentiality of unambiguous max-plus tree automata (Q2048206) (← links)
• Approximate minimization of weighted tree automata (Q2064525) (← links)
• Principal abstract families of weighted tree languages (Q2064529) (← links)
• Disambiguation of weighted tree automata (Q2096595) (← links)
• Ambiguity hierarchies for weighted tree automata (Q2117674) (← links)
• Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids (Q2136289) (← links)
• Weighted tree automata with constraints (Q2164002) (← links)
• Sequentiality of group-weighted tree automata (Q2232288) (← links)
• A Kleene theorem for weighted tree automata over tree valuation monoids (Q2280327) (← links)
• Hyper-optimization for deterministic tree automata (Q2344747) (← links)
• Characterizing weighted MSO for trees by branching transitive closure logics (Q2355685) (← links)
• Efficient enumeration of weighted tree languages over the tropical semiring (Q2424678) (← links)
• The supports of weighted unranked tree automata (Q2805397) (← links)
• Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers (Q2941142) (← links)
• Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics (Q2947150) (← links)
• (Q2992569) (← links)
• (Q3077192) (← links)
• DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA (Q3634180) (← links)
• -Treeautomata and their relation to weighted context-free grammars (Q3816997) (← links)
• Weighted Languages Recognizable by Weighted Tree Automata (Q4584658) (← links)
• (Q4654640) (← links)
• Compositions of Tree-to-Tree Statistical Machine Translation Models (Q4683236) (← links)
• (Q4899894) (← links)
• Crisp-determinization of weighted tree automata over strong bimonoids (Q5038197) (← links)
• Multilinear representations of free pros (Q5132617) (← links)
• (Q5871579) (← links)
• Combinatory categorial grammars as generators of weighted forests (Q6053406) (← links)
• Ambiguity Hierarchies for Weighted Tree Automata (Q6070750) (← links)
• Compositions with Constant Weighted Extended Tree Transducers (Q6072400) (← links)
• A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings (Q6137852) (← links)
• Weighted tree automata with constraints (Q6151146) (← links)
• A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices (Q6154974) (← links)
• Compositions of Weighted Extended Tree Transducers — The Unambiguous Case (Q6154977) (← links)
• Solving the Weighted HOM-Problem With the Help of Unambiguity (Q6204136) (← links)
• The impact of state merging on predictive accuracy in probabilistic tree automata: Dietze's conjecture revisited (Q6546586) (← links)
• Finite sequentiality of finitely ambiguous max-plus tree automata (Q6614608) (← links)
• The impact of state merging on predictive accuracy in probabilistic tree automata: Dietze's conjecture revisited (Q6615310) (← links)
• Rational weighted tree languages with storage (Q6647747) (← links)
• A Nivat theorem for weighted alternating automata over commutative semirings (Q6649528) (← links)
• The weighted HOM-problem over fields (Q6671672) (← links)