Multiple Choice
Which one of the following statement is true for a regular language L over {a} whose minimal finite state automation has two states?
A) L must be either {an I n is odd} or {an I n is even}
B) L must be {an I n is odd}
C) L must be {an I n is even}
D) L must be {an I n = 0}
Correct Answer:

Verified
Correct Answer:
Verified
Q26: Which of the following problems is undecidable?<br>A)Membership
Q27: The regular expression 0*(10)* denotes the same
Q28: Which of the following strings is not
Q29: Let P be a regular language and
Q30: Consider the NFA M shown below.<br><img src="https://d2lvgg3v3hfg70.cloudfront.net/MM963/.jpg"
Q32: A language is represented by a regular
Q33: Which of the following regular expression identity
Q34: The minimum state automaton equivalent to the
Q35: Consider the following CFG S ? aB
Q36: Which of the following are regular sets?<br>A)I