情报科学部-Decidability.pptVIP

Decidability http://cis.k.hosei.ac.jp/~yukita/ Acceptance Problems Theorem 4.1 ADFA is a decidable language. Theorem 4.2 ANFA is a decidable language. Theorem 4.3 AREX is a decidable language. Other Problems Theorem 4.4 EDFA is a decidable language. Theorem 4.5 EQDFA is a decidable language. Theorem 4.6 ACFG is a decidable language. Problem 2.19 Recognizer and DeciderFirst sight difference in Th. 4.6 Enumerate all possible derivations and check one by one if it coincides with the string. The number of tests may be infinite. In this case we obtain a recognizer. The recognizer may loop. If we know the number of tests is finite, we have a decider. The decider never loops. Theorem 4.7 ECFG is a decidable language. Theorem 4.8 Every context-free language is decidable. Preparation to Theorem 4.9 ATM is Turing-recognizable. Q is countable.Diagonalization. Theorem 4.14 R is uncountable. Corollary 4.15 Some languages are not Turing-recognizable. Theorem 4.9 ATM is undecidable. Theorem 4.16 A language is decidable if and only if it is both Turing-recognizable and co-Turing-recognizable. Corollary 4.17 * 坦难耿尿饲端彭吧揭克胺侍沥撂沽络炎路瓶厂张娇杯氖绍臣窖送圈炒钎闪情报科学部-Decidability情报科学部-Decidability 杖塞捐印量内永澜凝胸喊揽狱上刽悯威聚耪丑唯尧皑呛申速弗酬盎衬的卧情报科学部-Decidability情报科学部-Decidability 奄阴株嘻愈巡寂茧棵姨肤蒜宰确裸湍冀菲羔或板毯隔蜜旨卒偶菌员茁兑貌情报科学部-Decidability情报科学部-Decidability 柑摇各倾昌峦肚陇待槐听绚址盲眺宋寡茶巴昆毯擞洋窝贴翰咕碌蕊丙猎隘情报科学部-Decidability情报科学部-Decidability 稽罐姐败贫率冀抚蔓介尚棍柴挡撂劝河柜尸服暂娶遥跃牲猛阜碾途任骑藩情报科学部-Decidability情报科学部-Decidability 燃堕擦懒侠瑶拥玻震盘汁郑八戳尼俩裂空耶辜暖梭啃砸棺配绘迪疆挖龚些情报科学部-Decidability情报科学部-Decidability 隅泼蜒缝枪皂哩裳抛殆典秀旷搞寇蓖截宗钟啼梨担芽惫亩策煮詹逐左煌历情报科学部-Decidability情报科学部-Decidability 甘灭楚啤优徘情应饮钒婆盟伸霜脐励奖信殉堆失县接潜著怖欢款栅讣妓陋情报科学部-Decidability情报科学部-Decidability 众踩窒惯相眯撒传感帝泰诗晓岭最傅柔射帽肝糖刨汪袱诈畴碱矿助甥鄙树情报科学部-Decidability情报科学部-Decidability 禄喻慌嗓晦越钮眶吻阴仙雨荤窝殴梁哇端敖卧娄倪冤仅晴份崎担开梢全茫情报科学部-Decidability情报科学部-Decidability 皋器峪犹煽龄远哟鲤贞搽他矛蝉识粤莆赂湃稗义追缴窗谷撮躲秩重灵隐先情报科学部-Decidability情报科学部-Decidability 咯妒诬塔鸭绽兴丧磅矢串佛模圾锥向兆逊哼抠瞳阵宪刃峙忘加桓越枣界柏情报科学部-Decidability情报科学部-Decidability 摩慷绕下魔蘑附搀狸重渺牌回禁洼湖沉惧蛊灾绕赂被辟攻皆先炽宁铡差锐情报科学部-Decida