Nondeterministic finite automaton

This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.

An epsilon-NFA relates a state and input symbol or epsilon to possible successor states; one full-input final path suffices for acceptance.

atlas-nondeterministic-finite-automaton · canonical_mko

Prerequisite nodes