Question: Answer True or False. For either case, explain your answer. a) If an NFA accepts language (L), then an NFA that accepts the compliment of
Answer True or False. For either case, explain your answer.
a) If an NFA accepts language (L), then an NFA that accepts the compliment of (L) can be constructed by making all the accept states non-accept states and vice-versa.
b) Is it not possible to have two topologically different DFAs that recognize the same language and have the same number of states.
c) A regular expression associated with a minimal DFA is unique.
d) Two strings are distinguishable by language L if a DFA recognizing L places them in different states.
e) The size of the largest set of strings that are pairwise distinguishable by language L is equal to the number of states in the minimal DFA that recognizes L.
f) All DFAs are deciders while not all NFAs are deciders.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
