85 citations · 354 across the 71 of their papers we have counts for
1 paper · 2 filters
Javier Esparza, Pierre Ganty, Rupak Majumdar
A class of languages C is perfect if it is closed under Boolean operations and the emptiness problem is decidable. Perfect language classes are the basis for the automata-theoretic…