### 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

- Computer science/Automata and formal languages

### Session Finite_Automata_HF

- Finite_Automata_HF

### Depends on

- The Hereditarily Finite Sets
- Regular Sets and Expressions

### Auto-related entries

- The Myhill-Nerode Theorem Based on Regular Expressions
- Myhill-Nerode Theorem for Nominal G-Automata

## Cite

×

Finite_Automata_HF-AFP

    @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:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 18, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Oct 10, 2017 : Isabelle2017
- Dec 17, 2016 : Isabelle2016-1
- Feb 22, 2016 : Isabelle2016
- May 27, 2015 : Isabelle2015
- Feb 5, 2015 : Isabelle2014