ZK Regex Tools
The best tools to visualize DFS graphs using regex.
If in doubt, select this tool. Input regex expressions and strings from your email, and select visually the states that you want to make public. This tool will spit out your final circom circuit for you!
Convert simple regular expressions to minimum deterministic finite
automatons automatically via a Regex => NFA => DFA => Min-DFA flow,
and view the resulting graph visually.
For additional utilities, see the original toolbox. To understand what ZK Regex is and how it works, see our blog post.