5 citations · 8 across the 5 of their papers we have counts for
1 paper · 1 filter
Michael Wehar
We reinvestigate known lower bounds for the Intersection Non-Emptiness Problem for Deterministic Finite Automata (DFA's). We first strengthen conditional time complexity lower boun…