ask Questions about CS, WAIT ON LINE****# Unix - 噫吁兮，危乎高哉
s*e
1 楼
PLEASE, HOMEWORK DURE TOMORROW
1.Give an NFA over a single letter alphabet that rejects some string, but the
length of the shortest rejected string is strictly more than the number of
states.
2. explain clearnly why the following proof is not valid:
claim for every n in the positive integer, there is an n-state NFA that is
not equivelent to any n-state DFA.
proof. Let n be any positive integer, since there are more n-state NFAs than
n-state DFAs, so there must be some n-state NFA that is not si
1.Give an NFA over a single letter alphabet that rejects some string, but the
length of the shortest rejected string is strictly more than the number of
states.
2. explain clearnly why the following proof is not valid:
claim for every n in the positive integer, there is an n-state NFA that is
not equivelent to any n-state DFA.
proof. Let n be any positive integer, since there are more n-state NFAs than
n-state DFAs, so there must be some n-state NFA that is not si
