1. A method comprising: receiving a regular expression; creating a deterministic finite automaton (DFA) based on the regular expression; and generating, by a processor, an elementary string set using the DFA, wherein the elementary string is generated to test software that uses the regular expression.