Regular Expression Tools
Convert regular expressions to and from finite automata.
Regular Expression to NFA Converter
Uses Thompson's Construction algorithm. Use '|' for union, '*' for Kleene star, and '()' for grouping. Concatenation is implicit.
Convert regular expressions to and from finite automata.
Uses Thompson's Construction algorithm. Use '|' for union, '*' for Kleene star, and '()' for grouping. Concatenation is implicit.