应该是 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