1,073 views
3 votes
3 votes

Merge each of the primitive flow table shown in the figure.

Proceed as follows:

  1. Find all compatible pairs by means of implication table.
  2. Find the maximal compatibles by means of a merger diagram
  3. FInd the minimal set of compatibles that covers all the states and is closed.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
0 answers
2
0 votes
0 votes
0 answers
3
0 votes
0 votes
0 answers
4