Finite Automata in Hereditarily Finite Set Theory Lawrence C. PaulsonFinite 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.
Paper: http://www.cl.cam.ac.uk/~lp15/papers/Formath/automata.pdf AFP entry: http://afp.sourceforge.net/entries/Finite_Automata_HF.shtml Enjoy!
Description: S/MIME Cryptographic Signature