A Formalisation of Finite Automata Using Hereditarily Finite Sets

Abstract. 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.

• Type: Journal
• Year: 2015
• Where: CADE
• Authors: Lawrence C. Paulson
• Keywords: CADE 2015, Logical Reasoning