6 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.FL2026
Every Regular Language Has a Bipartite Cactus Automaton
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…
math.CO2016★ 6 cited
Colouring and Covering Nowhere Dense Graphs
Martin Grohe, Stephan Kreutzer, Roman Rabinovich +2
It was shown by Grohe et al. that nowhere dense classes of graphs admit sparse neighbourhood covers of small degree. We show that a monotone graph class admits sparse neighbourhood…