937 views
0 votes
0 votes
Minimum states required for DFA that accepts :

L = {w1 x w2 | w,x belongs to {a,b}* | w1 >= 0, w2 > 1 and x >= 0 }.

1 Answer

Best answer
3 votes
3 votes

we have,

L = {w1 x w2 | w,x belongs to {a,b}* | w1 >= 0, w2 > 1 and x >= 0 }.

means regular expression for L = (a+b)*  (a+b)* (a+b)2(a+b)*

                                                   =set of strings having length atleast 2.

so number of states in minimal DFA = 3 states.

 

selected by

Related questions

0 votes
0 votes
2 answers
1
aditi19 asked Dec 14, 2018
1,493 views
Given following NFAfind the minimal equivalent DFA
0 votes
0 votes
0 answers
2
Harshitha 123 asked Jun 12, 2018
402 views
How many states will be present in L={w/(n(a) + (2 n(b)mod 3)) lessthan 2} ? (I got 7 states is that correct)
1 votes
1 votes
1 answer
3
kislaya Pant asked May 8, 2018
1,063 views
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4)....