20 citations · 62 across the 23 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2017
A short proof of correctness of the quasi-polynomial time algorithm for parity games
Hugo Gimbert, Rasmus Ibsen-Jensen
Recently Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li and Frank Stephan proposed a quasi-polynomial time algorithm for parity games. This paper proposes a short pr…
cs.FL2015★ 8 cited
Edit Distance for Pushdown Automata
Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen +1
The edit distance between two words is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform to . The…