DisplayCover
Preface
Contents
Index
Glossary
Models
Rogues
| |
Finite State Automata
(Contents)


-
The Finite State Automaton
The Kinds of Problems that Finite State Automata can Solve
 |
Intuition |
 |
Contrived Examples |
 |
Real-World Examples |
 | A Characterization: The Pumping Lemma |
 |
Exercises
|
The Kinds of Problems that Finite State Automata cannot
Solve
 |
Intuition |
 |
Contrived Examples |
 | Real-World Examples |
 |
Applying the Pumping Lemma |
 |
Exercises
|
Implementing a Finite State Automaton as a Program
 |
Intuition |
 |
Converting a finite state automaton to a program |
 |
Animated Examples |
 |
Exercises
|
Nondeterministic Finite State Automata
 |
Intuition |
 |
Animated examples |
 |
Showing that nondeterministic and deterministic finite
state automata are equivalent |
 |
Exercises
|
Regular Expressions and Finite State Automata
 |
Intuition |
 | Animated examples |
 | A definition |
 | Showing that regular expressions and finite state
automata are equivalent |
 |
Exercises
|
Regular Grammars and Finite State Automata
 |
Intuition |
 |
Animated examples |
 | A definition |
 | Showing that regular grammars and finite state
automata are equivalent |
 |
Exercises |
|