The Moore reduction procedure is a method used for minimizing computer states in a state machine. 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 can be combined.

PropertyValue
dbpprop:abstract
  • The Moore reduction procedure is a method used for minimizing computer states in a state machine. 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 can be combined. Equivalence partitions are numbered by the number of steps it took to get to that point. The 0 partition contains all the states in one group, the 1 partition contains states grouped by their outputs 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 partition are called k-distinguishable states. States that are in the same group on the k 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.
dbpprop:hasPhotoCollection
rdfs:comment
  • The Moore reduction procedure is a method used for minimizing computer states in a state machine. 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 can be combined.
rdfs:label
  • Moore reduction procedure
owl:sameAs
skos:subject
foaf:page
is dbpprop:redirect of