9 citations · 16 across the 4 of their papers we have counts for
1 paper · 1 filter
N. Rampersad, J. Shallit, Z. Xu
In this paper we consider the computational complexity of the following problems: given a DFA or NFA representing a regular language L over a finite alphabet Sigma is the set of al…