16 citations · 35 across the 16 of their papers we have counts for
1 paper · 2 filters
Mikhail N. Vyalyi
A regular realizability (RR) problem is testing nonemptiness of intersection of some fixed language (filter) with given regular language. We study here complexity of RR problems. I…