Finite Automata in Hereditarily Finite Set Theory

Lawrence C. Paulson 🌐

February 5, 2015

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

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.

License

BSD License

Topics

Session Finite_Automata_HF

Depends on

Cite

× 
@article{Finite_Automata_HF-AFP,
  author  = {Lawrence C. Paulson},
  title   = {Finite Automata in Hereditarily Finite Set Theory},
  journal = {Archive of Formal Proofs},
  month   = {February},
  year    = {2015},
  note    = {\url{https://isa-afp.org/entries/Finite_Automata_HF.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: