情报科学部-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