generated at
regular expression
Thompson's construction – converts a regular expression into an equivalent nondeterministic finite automaton (NFA)