Pages that link to "Item:Q3452195"
From MaRDI portal
The following pages link to Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations (Q3452195):
Displayed 38 items.
- Optimal probabilistic generation of XML documents (Q269313) (← links)
- Branching-time model-checking of probabilistic pushdown automata (Q394999) (← links)
- A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars (Q396602) (← links)
- Space-efficient scheduling of stochastically generated tasks (Q418125) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- Derivation tree analysis for accelerated fixed-point computation (Q549189) (← links)
- Runtime analysis of probabilistic programs with unbounded recursion (Q743128) (← links)
- Model-free reinforcement learning for branching Markov decision processes (Q832301) (← links)
- Convergence of Newton's method over commutative semirings (Q899320) (← links)
- Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (Q1641009) (← links)
- Markov chains and Markov decision processes in Isabelle/HOL (Q1701041) (← links)
- On the metric-based approximate minimization of Markov chains (Q1785848) (← links)
- Good edit similarity learning by loss minimization (Q1945121) (← links)
- Equational theories for automata (Q2074221) (← links)
- Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy (Q2177476) (← links)
- Analyzing probabilistic pushdown automata (Q2248071) (← links)
- Language equivalence of probabilistic pushdown automata (Q2252520) (← links)
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems (Q2272985) (← links)
- Hyperplane separation technique for multidimensional mean-payoff games (Q2361356) (← links)
- Recursive stochastic games with positive rewards (Q2422034) (← links)
- Recursive Markov Decision Processes and Recursive Stochastic Games (Q2796398) (← links)
- Ratio and Weight Quantiles (Q2946351) (← links)
- On the Existence and Computability of Long-Run Average Properties in Probabilistic VASS (Q2947866) (← links)
- On Probabilistic Parallel Programs with Process Creation and Synchronisation (Q3000662) (← links)
- Runtime Analysis of Probabilistic Programs with Unbounded Recursion (Q3012930) (← links)
- Stochastic Process Creation (Q3182911) (← links)
- The Odds of Staying on Budget (Q3449479) (← links)
- (Q4558784) (← links)
- Model checking with probabilistic tabled logic programming (Q4911143) (← links)
- (Q5009454) (← links)
- (Q5020647) (← links)
- (Q5028436) (← links)
- (Q5091277) (← links)
- Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (Q5108256) (← links)
- (Q5129945) (← links)
- A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes (Q5363381) (← links)
- Be lazy and don't care: faster CTL model checking for recursive state machines (Q6045062) (← links)
- Model Checking Temporal Properties of Recursive Probabilistic Programs (Q6137848) (← links)