28) What can be said about a regular language L over {a} whose minimal finite state automation has two states?
Answer is:
L must be {an |n is even}
Related Theory of Computation MCQ with Answers
Answer is:
non-terminals on the right hand side
Answer is: