Regex2NFA is an interactive tool that helps you understand how regular expressions are converted into Non-deterministic Finite Automata (NFAs). It provides a visual representation of the conversion process and allows you to simulate how the NFA processes input strings.

This tool is particularly useful for:

• Learning about regular expressions and NFAs
• Understanding the conversion process
• Debugging and testing regular expressions
• Visualizing automata theory concepts

1. 1.

   Enter a Regular Expression

   Use operators like | (or), * (zero or more), + (one or more), ? (optional), and () for grouping

2. 2.

   Visualize the NFA

   Click the Visualize button to see the NFA representation

3. 3.

   Test with Strings

   Enter test strings and use the simulation controls to see how the NFA processes them