Implication table
From Wikipedia, the free encyclopedia
 |
This article does not cite any references or sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (December 2006) |
 |
This article is an orphan, as few or no other articles link to it. Please introduce links to this page from related articles; suggestions may be available. (November 2009) |
An implication table is a tool used to facilitate the minimization of states in a state machine. The concept is to start assuming that every state may be able to combine with every other state, then eliminate combinations that are not possible. When all the impossible combinations have been eliminated, the remaining state combinations are valid, and thus can be combined.
The procedure is as follows:
- List state-combination possibilities in an implication table,
- Eliminate combinations that are impossible because the states produce different outputs,
- Eliminate combinations that are impossible because the combination depends on the equivalence of a previously eliminated possibility,
- Repeat the above step until no more eliminations are possible.
[edit] See also
 |
This formal methods-related article is a stub. You can help Wikipedia by expanding it. |
