**CS 301K Foundations of Logical Thought
**

**Finite
State Machine Project**

A
finite state machine (FSM) is a formal model of computation that is very useful
for describing solutions to a large class of problems. Here are some finite state machines that
you use every day:

·
Vending
machines

·
Traffic
lights

·
Password
checkers

·
Spelling
checkers

We
are going to build a finite state machine that checks for valid passwords
(according to a set of rules that we’ll provide).

For
this project, we’ll use JFLAP, an FSM simulation tool. You can download JFLAP (it’s free)
from: