應該是 Introduction to the Theory of Computation (http://www-math.mit.edu/~sipser/book.html) 裡 4.1 列的一大串, 不外乎是 http://www.cis.uoguelph.ca/~sawada/3620/notes/decidability-1x2.pdf 一開始的那一串 * L1 =?= L2 * L1 =?= empty set * L1 =?= A* (A = alphabet set) * w \in L1 ? 就是跟 L1, L2 有關的命題... 至於應該是哪些因為課本不在手邊所以現在也列不完整 反正記得 regular language 幾乎全是 decidable CFG intersection, negation 不是 closure 就差不多了 XDD ※ 引述《StubbornLin (Victor)》之銘言： : 設L1與L2是任意finite-state languages, G是任意regular grammar : 試列舉哪些關於L1, L2或G的objects是可以decideable? : (有6個objects可以列舉) : 我不是要問答案= = : 而是我實在看不懂這題的題意到底是什麼 : 什麼叫objects可以decideable? : 是不是有寫錯字還什麼? 提示是有6個 : 所以請問這題目到底是要問什麼 囧? -- And in that line now was a whiskered old man, with a linen cap and a crooked nose, who waited in a place called the Stardust Band Shell to share his part of the secret of heaven: that each affects the other and the other affects the next, and the world is full of stories, but the stories are all one. --

※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 140.112.30.54