1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LO2024★ 1 cited
Rabin Games and Colourful Universal Trees
Rupak Majumdar, Irmak Saglam, K. S. Thejaswini
We provide an algorithm to solve Rabin and Streett games over graphs with vertices, edges, and colours that runs in time and $O…
cs.FL2024
Directed Regular and Context-Free Languages
Moses Ganardi, Irmak Saglam, Georg Zetzsche
We study the problem of deciding whether a given language is directed. A language is \emph{directed} if every pair of words in have a common (scattered) superword in . D…