Tuesday, 31 May 2011

Finite State Machine



The finite state system represents a mathematical model of a system with certain input. The model finally gives certain output. The input when is given to the machine it is processed by various states, these states are called as intermediate states.
The very good example of finite state system is a control mechanism of elevator. This mechanism only remembers the current floor number pressed, it does not remember all the previously pressed numbers.
The finite state system is a very good deign tool for the programs such as text editors and lexical analyzer (which is used in compilers). The lexical analyzer is a program which scans your program character by character and recognizes those words as tokens.

No comments:

Post a Comment