activity
20092020
most citedApproximating the Termination Value of One-Counter MDPs and Stochastic Games

2 citations · 3 across the 4 of their papers we have counts for

collaborators
Showing cs.FLShow all

1 paper · 1 filter

cs.FL2013

Stochastic Context-Free Grammars, Regular Languages, and Newton's Method

Kousha Etessami, Alistair Stewart, Mihalis Yannakakis

We study the problem of computing the probability that a given stochastic context-free grammar (SCFG), G, generates a string in a given regular language L(D) (given by a DFA, D). T…