Deterministic finite automaton

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

A DFA consists of finite states, a finite alphabet, a total transition function, one initial state and a subset of accepting states.

atlas-finite-automaton · canonical_mko

Prerequisite nodes