- main page: state transition table.
A state table defines all details of the behaviour of a state of a VFSM. It consists of three columns: in the first column state names are used, in the second the virtual conditions built out of input names using the positive logic algebra are placed and in the third column the output names appear:
| State Name | Condition(s) | Actions(s) |
|---|---|---|
| Current state | Entry action | Output name(s) |
| Exit action | Output name(s) | |
| Virtual condition | Output name(s) | |
| ... | ... | |
| Next state name | Virtual condition | Output name(s) |
| Next state name | Virtual condition | Output name(s) |
| ... | ... | ... |
Read the table as following: the first two lines define the entry and exit actions of the current state. The following lines which do not provide the next state represent the input actions. Finally the lines providing the next state represent the state transition conditions and transition actions. All fields are optional. A pure combinatorial VFSM is possible in case only where input actions are used, but no state transitions are defined. The transition action can be replaced by the proper use of other actions.
Read more about this topic: Virtual Finite-state Machine
Famous quotes containing the words state and/or table:
“But the nomads were the terror of all those whom the soil or the advantages of the market had induced to build towns. Agriculture therefore was a religious injunction, because of the perils of the state from nomadism.”
—Ralph Waldo Emerson (1803–1882)
“The newspaper is a Bible which we read every morning and every afternoon, standing and sitting, riding and walking. It is a Bible which every man carries in his pocket, which lies on every table and counter, and which the mail, and thousands of missionaries, are continually dispersing. It is, in short, the only book which America has printed, and which America reads. So wide is its influence.”
—Henry David Thoreau (1817–1862)