Pages that link to "Item:Q5415502"

The following pages link to Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars (Q5415502):

Displaying 9 items.

• A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars (Q396602) (← links)
• Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (Q1641009) (← links)
• Approximate minimization of weighted tree automata (Q2064525) (← links)
• Analyzing probabilistic pushdown automata (Q2248071) (← links)
• Recursive Markov Decision Processes and Recursive Stochastic Games (Q2796398) (← links)
• A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing (Q2943574) (← links)
• (Q5009454) (← links)
• Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (Q5108256) (← links)
• A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes (Q5363381) (← links)