Non-deterministic Finite Automaton (NFA)

N = (Q, E, 𝛿, q0, F )

Q =
E =
q0 =
F =
𝛿 =

Deterministic Finite Automaton (DFA)

M = (Q', E, 𝛿', q0', F' )

Q' =
E =
q0' =
F' =
𝛿 =

This application was created by Joey Lemon and Camille Williford during the summer of 2021 for Dr. Michael Berry as an independent study project in COSC 493 at the University of Tennessee. It is an adaptation of the original application by Alex Klibisz and Connor Minton , also created for Dr. Michael Berry as an honors-by-contract project in COSC 312 during the spring of 2015.

Source