25 citations · 40 across the 9 of their papers we have counts for
1 paper · 1 filter
Christian Rauch, Markus Holzer
We investigate the accepting state complexity of deterministic finite automata for regular languages obtained by applying one of the following operations to languages accepted by p…