Citations:subregular


 * 2010 Markus Holzer et al, "The Magic Number Problem for Subregular Language Families" arXiv
 * We obtain similar results for automata accepting subregular languages like, for example, combinational languages, star-free, prefix-, suffix-, and infix-closed languages, and prefix-, suffix-, and infix-free languages, showing that there are only trivial magic numbers, when they exist.