What can be said about a regular language L over {a} whose minimal finite state automaton has two states?
Posted: Thu Jul 14, 2022 9:07 am
a) L must be {an| n is odd}
b) L must be {an| n is even}
c) L must be {an| n is even}
d) Either L must be {an | n is odd}, or L must be {an | n is even}
b) L must be {an| n is even}
c) L must be {an| n is even}
d) Either L must be {an | n is odd}, or L must be {an | n is even}