3 citations · 9 across the 7 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.FL2015★ 2 cited
Regular realizability problems and context-free languages
Alexander A. Rubtsov, Mikhail N. Vyalyi
We investigate regular realizability (RR) problems, which are the problems of verifying whether intersection of a regular language -- the input of the problem -- and fixed language…
cs.FL2015★ 3 cited
Regular realizability problems and regular languages
Alexander A. Rubtsov
We investigate regular realizability (RR) problems, which are the problems of verifying whether intersection of a regular language -- the input of the problem -- and fixed language…