A Formalisation of Finite Automata using Hereditarily Finite Sets [article]

Lawrence C. Paulson
2015 arXiv   pre-print
Hereditarily finite (HF) set theory provides a standard universe of sets, but with no infinite sets. Its utility is demonstrated through a formalisation of the theory of regular languages and finite automata, including the Myhill-Nerode theorem and Brzozowski's minimisation algorithm. The states of an automaton are HF sets, possibly constructed by product, sum, powerset and similar operations.
arXiv:1505.01662v1 fatcat:wezqpg5of5ehrmngw5oncxggmq