Finite automata

Home > Languages > Formal Language > Regular Languages > Finite automata

Finite automata are machines that accept or reject input strings based on a set of rules. There are two types of finite automata: deterministic finite automata (DFA) and non-deterministic finite automata (NFA).