23 citations · 34 across the 2 of their papers we have counts for
2 papers
cs.FL2022★ 11 cited
Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness
Tamajit Banerjee, Rupak Majumdar, Kaushik Mallik +2
We consider fixpoint algorithms for two-player games on graphs with -regular winning conditions, where the environment is constrained by a strong transition fairness assumption.…
cs.LO2008★ 23 cited
Bounded Underapproximations
Pierre Ganty, Rupak Majumdar, Benjamin Monmege
We show a new and constructive proof of the following language-theoretic result: for every context-free language L, there is a bounded context-free language L' included in L which…