Finite Automata in Hereditarily Finite Set Theory (Q7361658)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Finite_Automata_HF
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finite Automata in Hereditarily Finite Set Theory |
AFP entry Finite_Automata_HF |
Statements
5 February 2015
0 references
Lawrence C. Paulson
0 references
Finite Automata in Hereditarily Finite Set Theory (English)
0 references
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.
0 references
