Search over one million articles, find something about almost anything! | | | |
|
| |
|
Finite
state
machine |
|
... reads in a string of
symbols from its alphabet. It uses the transition relation T to determine
the next state(s) using the current state(s) and the symbol just read. ... |
|
|