Finite State Automata
(Contents)
-
Deterministic Finite State Automata
 |
Definition |
|
Examples |
Characterizing the Sets Accepted by Finite State Automata
|
The Pumping Lemma |
|
Applying the Pumping Lemma |
Nondeterministic Finite State Automata
| |
| |
|
Equivalence of Deterministic and Nondeterministic Finite
State Automata |
Regular Expressions
|
Definition |
|
Regular Sets |
|
Equivalence of Finite State Automata and Regular
Expressions |
Regular Grammars
|
Definition |
|
Regular Languages |
|
Equivalence of Regular Grammars and Finite State
Automata |
Going Further
