02 2015 档案

pumping lemma for finite regular language?
摘要：some books describe pumping lemma as this:LetLbe a regular language. Then there exists an integerp≥ 1 depending only onLsuch that every stringwinLof l... 阅读全文
posted @ 2015-02-28 05:32 zmiao 阅读(238) 评论(0) 推荐(0)