289 views

2 Answers

2 votes
2 votes
3 is not true because both the non final states are same.

4 is not true because 11 is rejected so all the strings of length atleast 2 is not accepted.

So option d.
1 votes
1 votes
Given DFA "A" is not minimal, if we apply minimization on it we will end up with 2 states. One state will be formed by two non final states, Second state will be single final state.So Minimal DFA will be of 3 states.

DFA "A" is also accepting string of length one, for eg:{ 0 } is also accepted.

By looking at these  two conditions, point number 3 and 4 will be false.

option (D) will be answer......

Related questions

0 votes
0 votes
0 answers
1
Sanjay Sharma asked Apr 15, 2017
350 views
0 votes
0 votes
1 answer
2
Sanjay Sharma asked Apr 15, 2017
687 views
The machine pictured in fig a)complements a given bit pattern b)finds 2's complement c)increments a given bit pattern by 1d)changes the sign bit
0 votes
0 votes
1 answer
3
Sanjay Sharma asked Mar 30, 2017
277 views
The following CFG S->aS| bS| a| bis equivalent to the regular expression a)(a*+b)* b)(a+b)+c)(a+b)(a+b)* d)(a+b)* (a+b)
0 votes
0 votes
1 answer
4