b*****s
发帖数: 29 | 1 【 以下文字转载自 JobHunting 讨论区 】
【 原文由 sweetMouse 所发表 】
【 以下文字转载自 Unix 讨论区,原文如下 】
发信人: sweetMouse (Little Mouse), 信区: Unix
标 题: ask Questions about CS, WAIT ON LINE****
发信站: Unknown Space - 未名空间 (Tue Feb 10 23:33:44 2004) WWW-POST
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 th |
|
