1 paper
Mario Grobler, Till Koziel, Sebastian Siebertz
Thompson's classical construction turns every regular expression into an equivalent epsilon-NFA whose transition graph is series-parallel. The construction uses epsilon-transitions…