Finite Automata in Hereditarily Finite Set Theory

Lawrence C. Paulson 🌐

February 5, 2015


Finite Automata, both deterministic and non-deterministic, for regular languages. The Myhill-Nerode Theorem. Closure under intersection, concatenation, etc. Regular expressions define regular languages. Closure under reversal; the powerset construction mapping NFAs to DFAs. Left and right languages; minimal DFAs. Brzozowski's minimization algorithm. Uniqueness up to isomorphism of minimal DFAs.
BSD License


Theories of Finite_Automata_HF