Recent questions tagged finite-automata

1 votes
0 answers
609
0 votes
0 answers
610
$ L = \{ wxwy \ | \ \ x,y,w \ \ \epsilon\ ( a + b )^+ \} $Draw the DFA and also write the Reg exp for the above language.
2 votes
2 answers
611
2 votes
2 answers
614
What is the min no. of states required in DFA which accepts all strings starting with 1 and whose decimal value is divisible by 7?
0 votes
1 answer
615
Design a DFA that accepts all strings ending with three consecutive zeros over {0,1}
2 votes
0 answers
617
Consider a NFA with 6 states, what will be minimum number of states in corresponding DFA?A)6 B)64 C)36 D)1
0 votes
1 answer
619
0 votes
1 answer
621
0 votes
2 answers
623
0 votes
2 answers
624
0 votes
1 answer
627
Regular Expression of the NFA :A. 2*(0+12*)*B. 2*(0+2*)1*C. 2*(0+ 12*)D. 2*(01+12)*
1 votes
0 answers
628
L = {s ∈ (0 + 1)* d(s)mod5 = 2 or d(s)mod7 != 4} where d(s) is the decimal equivalent of the binary string s.How many states does the above DFA have? How many final sta...
2 votes
1 answer
629