What can be said about a regular language L over {a} whose minimal finite state automation has two states?
| A. | L must be { an | n is odd} |
| B. | L must be { an | n is even} |
| C. | L must be {an | > 0} |
| D. | Either L must be {an | n is odd}, or L must be {an | n is even} |
Answer : B Explanation : Shruti said: (10:49am on Wednesday 19th August 2015)
Option [A] will also generate a minimal dfa of two states.
Arjun Rou said: (7:16pm on Tuesday 3rd January 2017)
F.A accepting odd no of {a} also have a minimum two states. According to me right option should be been option (D)
VIJAY said: (2:00pm on Sunday 25th June 2017)
C SHOULD BE CORRECT ANSWER.
Vandana said: (6:43am on Thursday 15th February 2018)
All the options are correct wrt the given question, we can have a dfa with 2 states for all the given options.
|
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
