From: Tobias Nipkow <nipkow@in.tum.de>
Finite Automata in Hereditarily Finite Set Theory
Lawrence C. Paulson
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.
Paper: http://www.cl.cam.ac.uk/~lp15/papers/Formath/automata.pdf
AFP entry: http://afp.sourceforge.net/entries/Finite_Automata_HF.shtml
Enjoy!
smime.p7s
Last updated: Nov 21 2024 at 12:39 UTC