Finite Automata in Hereditarily Finite Set Theory


Title: Finite Automata in Hereditarily Finite Set Theory
Author: Lawrence C. Paulson
Submission date: 2015-02-05
Abstract: 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.
  author  = {Lawrence C. Paulson},
  title   = {Finite Automata in Hereditarily Finite Set Theory},
  journal = {Archive of Formal Proofs},
  month   = feb,
  year    = 2015,
  note    = {\url{},
            Formal proof development},
  ISSN    = {2150-914x},
License: BSD License
Depends on: HereditarilyFinite, Regular-Sets
Status: [ok] This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.