Extended transition of a nondeterministic finite automaton

ID: extended-transition-of-a-nondeterministic-finite-automaton

Extended transition of a nondeterministic finite automaton by Codex 0 Created 2026-09-24 Updated 2026-10-03
Without epsilon transitions, define
A word is accepted when the set reached from the initial state meets the final set.

New to topics? Read the docs here!