871 views
0 votes
0 votes
Given L = { 0*1 + 0 + 1* + 10*1}

where + symbol is UNION and NOT positive closure.

Please draw the Minimal DFA for this.

2 Answers

0 votes
0 votes

Related questions

2 votes
2 votes
1 answer
1
iarnav asked Aug 16, 2017
759 views
I'm getting (a+ba*b)*a*b
2 votes
2 votes
4 answers
2
iarnav asked Aug 20, 2017
1,351 views
I'm getting R.E as 0*1(01)*1(0+1)* but people are getting (0+10)*11(1+0)*Please tell, how!?
1 votes
1 votes
1 answer
3
sripo asked Nov 6, 2018
2,977 views
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?
2 votes
2 votes
2 answers
4
iarnav asked Aug 29, 2017
944 views
input {a,b} Write R.E where every b is followed by at least 2 K a's? (K is +ve integer)