|
|
| Line 1: |
Line 1: |
| {{Unreferenced|date=December 2006}}
| | I would like to introduce myself to you, I am Andrew and my wife doesn't like it at all. What I adore doing is football but I don't have the time lately. Kentucky is exactly where I've usually been residing. Office supervising is exactly where her primary earnings comes from.<br><br>Feel free to visit my site; psychic chat online - [http://www.article-galaxy.com/profile.php?a=143251 go now] - |
| | |
| | |
| In computer science, the '''Moore reduction procedure''' is a method used for [[DFA minimization]].
| |
| | |
| The concept is to start assuming that every state may be able to combine with every other state, then separate distinguishable states into separate groups called '''equivalence partitions'''. When no more equivalence partitions contain distinguishable states, the states remaining in the same group as other states are combined. Equivalence partitions are numbered by the number of steps it took to get to that point. The 0th partition contains all the states in one group, the 1st partition contains states grouped by their [[output]]s only. Every partition from then on has groupings that are based on which group from the previous partition those states' next state fell under. The procedure is complete when partition ''n'' is the same as partition <math>n+1</math>.
| |
| | |
| States that are distinguishable on the ''k''<sup>th</sup> partition are called '''''k''-distinguishable''' states. States that are in the same group on the ''k''<sup>th</sup> partition are called '''''k''-equivalent'''. Note that states that are ''k''-equivalent at one point are not necessarily equivalent states, as they may be separated into separate groups in a higher partition.
| |
| | |
| The procedure is as follows:
| |
| # separate states into groups that have the same immediate output for the same current input,
| |
| # distinguish states whose next state(s) are in different groups.
| |
| # regroup the states and repeat the above step until no more states are distinguishable.
| |
| | |
| ==See also==
| |
| *[[Implication table]]
| |
| | |
| {{DEFAULTSORT:Moore Reduction Procedure}}
| |
| [[Category:Automata theory]]
| |
| | |
| | |
| {{Formalmethods-stub}}
| |
Latest revision as of 13:31, 1 November 2014
I would like to introduce myself to you, I am Andrew and my wife doesn't like it at all. What I adore doing is football but I don't have the time lately. Kentucky is exactly where I've usually been residing. Office supervising is exactly where her primary earnings comes from.
Feel free to visit my site; psychic chat online - go now -