Back to Search
Start Over
A Formalisation of Finite Automata Using Hereditarily Finite Sets
- Source :
- Automated Deduction-CADE-25 ISBN: 9783319214009, CADE
- Publication Year :
- 2015
- Publisher :
- Springer International Publishing, 2015.
-
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.
Details
- ISBN :
- 978-3-319-21400-9
- ISBNs :
- 9783319214009
- Database :
- OpenAIRE
- Journal :
- Automated Deduction-CADE-25 ISBN: 9783319214009, CADE
- Accession number :
- edsair.doi...........c2b049f7904d69d528398d23a6da70f9