2 citations · 2 across the 1 of their papers we have counts for
1 paper
Henning Fernau, Stefan Hoffmann, Michael Wehar
The problem DFA-Intersection-Nonemptiness asks if a given number of deterministic automata accept a common word. In general, this problem is PSPACE-complete. Here, we investigate t…