作者kuosos520 (kkk)
看板Grad-ProbAsk
標題[理工] 正規context-free languages(500P)
時間Tue Jun 21 16:31:48 2011
Q1:
Let L = {a^n b^n : n > = 0 }.
Show that L^k is context-free for any given k > = 1
Q2:
Prove the following result. Let G = (V,T,S,P) be a context-free grammar
in which every A屬於V occurs on the left side of at most one production.
Then G is unambiguous.
提供最佳的正確答案者,送500p(稅前),兩個各500p
如推文無法詳述,可私信來
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 134.208.3.71
1F:→ Byzantin:哪個所會考正規? 修完都忘光了= = 06/21 17:07
2F:推 privatewind:資工 可能會...至少是在課程內 06/21 22:03
3F:推 FRAXIS:第一題應該就是設計一個pushdown automata吧 06/22 01:29