1,015 views
0 votes
0 votes

Q- Give the min DFA corresponding to 01[((10)*+111)*+0]*1

Q-2 Consider the homomorphism , h(0)=aba, h(1)=abb

   Given L2=(a+bb)*ba find h-1(L2)

a) 0* b)100* c)1*0 d)11*0

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
2
VikramRB asked Jan 5, 2019
4,121 views
The Minimum DFA that accepts the given language is ____L = { w | w is any string not in a*b*}
0 votes
0 votes
0 answers
3
hacker16 asked Dec 17, 2017
279 views
No of states in Min DFA, that accepts (1)* over {0,1} alphabets is1 states2 statesNone of these
1 votes
1 votes
1 answer
4
iarnav asked Aug 18, 2017
1,390 views
Consider the regular language L=(00+0000)* . The minimum number of states in any DFA accepting this languages is?