You figure doesn't indicate what conditions lead from q5 to q4 and q5 is missing from your table.Hi,
DFA stands for deterministic finite automata which is drawn in the attached figure (as the first figure) having states q0, q1, q2, q3, q4 and q5.
You've got it backwards. There's no problem with two different inputs taking the machine from State 1 to State 2 -- that is a deterministic operation. What would make it non-deterministic is if the same input can take the machine from State 1 to two different states.Second figure shows the transition table which shows the movement from one state to another state based upon the inputs 1 or 0. If two different inputs from a state direct the edge to the same state , then its non-deterministic finite automata (NFA) otherwise, its a deterministic finite automata (DFA).
There are many algorithms for minimizing a DFA. I'm not familiar with the one you are trying to use (at least not based on your description this far).The third figure deals with marking procedure which I want to understand.
|Thread starter||Similar threads||Forum||Replies||Date|
|Product Of Sums Minimization||Homework Help||1|
|N||stuck with machine minimization problem||Homework Help||3|
|In Minimization of circuits with Logic Gates... K-maps method||Homework Help||4|
|B||SOP to POS and minimization.||Homework Help||4|
|S||Minimization POS K-Map 4-Input||Homework Help||3|
by Robert Keim
by Gary Elinoff
by Steve Arar