Finite - State Machines as Recognizers (UMAP)
Author: W.J. Barnier
This module develops the concept of a finite-state machine through number examples. It introduces regular expressions and establishes their connection with finite-state machines.
Table of Contents:
INTRODUCTION
DEFINITION AND EXAMPLES
MORE EXAMPLES AND INTRODUCTION TO REGULAR EXPRESSIONS
EXAMPLES WITH BINARY NUMBERS
LIMITATIONS OF FINITE-STATE MACHINES
PERSPECTIVE WHERE FSM FIT IN
REFERENCES FOR FURTHER READING
SOLUTIONS TO THE EXERCISES
You must have a Full Membership to download this resource.
If you're already a member, login here.