Register

#TOC DFA Query

307 views

1 Answer

0 votes
0 votes
these states cannot be merged ,until and unless if both the states on different i/p moves to the different states

example:

*{q0,q3,q4}-------->{q0,q1,q4} on i/p 0;   and   {q0,q3,q4}-------->{q0,q4}  on i/p 1;

*{q0,q1,q2,q4}-------->{q0,q1,q4} on i/p 0; and  {q0,q1,q2,q4}-------->{q0,q4}  on i/p 1;

if this occurs then we can merge ..... but this situation doesn't occur in this question ...
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
iarnav asked Mar 14, 2019
927 views
#TOC What will be the minimal DFA of this regular language?
Given L = { 0*1 + 0 + 1* + 10*1} where + symbol is UNION and NOT positive closure. Please draw the Minimal DFA for this.
Given L = { 0*1 + 0 + 1* + 10*1}where + symbol is UNION and NOT positive closure.Please draw the Minimal DFA for this.
User Avatar
0 votes
0 votes
2 answers
2
CSHuB asked Jan 24, 2019
544 views
#toc How to make DFA for this.
How to draw a DFA for the below language. $L$ = {$W | W \in$ $ (0, 1)^* $}; $W$ ends with 0 and contains the substring 100 } No. of states in minimal DFA.
How to draw a DFA for the below language.$L$ = {$W | W \in$ $ (0, 1)^* $};$W$ ends with 0 and contains the substring 100 }No. of states in minimal DFA.
User Avatar
2 votes
2 votes
4 answers
3
iarnav asked Aug 20, 2017
1,395 views
#TOC what will be the R.E of this DFA?
I'm getting R.E as 0*1(01)*1(0+1)* but people are getting (0+10)*11(1+0)* Please tell, how!?
I'm getting R.E as 0*1(01)*1(0+1)* but people are getting (0+10)*11(1+0)*Please tell, how!?
User Avatar
Link Copied!