Sciweavers

Share
CADE
2015
Springer

A Formalisation of Finite Automata Using Hereditarily Finite Sets

3 years 5 months ago
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.
Lawrence C. Paulson
Added 17 Apr 2016
Updated 17 Apr 2016
Type Journal
Year 2015
Where CADE
Authors Lawrence C. Paulson
Comments (0)
books