NFA (Non-deterministic Finite Automaton)
Create, visualize, test, and convert NFAs
Example NFAs
Ends with '01'
Accepts strings ending with '01'
Contains '101'
Accepts strings containing '101'
Starts with 'a', ends with 'b'
Uses epsilon transitions
States (0)
Alphabet (0)
Initial (0)
Trans (0)
States0
ΣAlphabet0
Transitions0
No transitions added yet
Add states and alphabet symbols first