Finite State machines
You should have come across finite state machines before.
They appear in the following courses.
- Theory of Computation
- Compiler Theory
- Natural Language Programming
A FST (S, I, O, T) is defined as follows:
- S
- A finite set of states
- I
- A finite set of inputs
- O
- A finite set of outputs
- T
- The trnasition map T : I x S --> S x O
To return to the software engineering home page click
HERE
Jonathan Hodgson
Last Change: Jan 16th 1995
