retagged by
427 views
1 votes
1 votes
self doubt

the minimal dfa for the given regular expression over the alphabet {0,1} is 1*(0+10)*1*?
retagged by

1 Answer

0 votes
0 votes

normal procedure is

Draw ∈-NFA ---> DFA ----> Minimize it

for this question, the minimized DFA is

 

one more method which i learn in ACE coaching center is :-

Related questions

0 votes
0 votes
1 answer
3
0 votes
0 votes
1 answer
4