FLA Project

Input the NFA

Enter the non-deterministic automata (NFA) transitions here, then define the final states and initial state.

• The left-hand current state of each transition must be filled in.
• [ λ ] - An empty text field corresponds to lambda (or epsilon).
• The finite set of states ( Q ) and the alphabet ( Σ ) will be generated automatically based on the transitions entered.
• Inputs are case-sensitive and whitespace is not ignored.
• All entries should be delimited by a comma, if permitted.

Verify

This is the NFA you have input above:

Equivalent DFA

Minimized DFA