Languages and Finite Automata WPI语言和有限 wpi B动机模型.pptVIP

Fall 2004 COMP 335 The Chomsky Hierarchy Decidability * Non-recursively enumerable Recursively-enumerable Recursive Context-sensitive Context-free Regular The Chomsky Hierarchy Consider problems with answer YES or NO Examples: Does Machine have three states ? Is string a binary number? Does DFA accept any input? A problem is decidable if some Turing machine decides (solves) the problem Decidable problems: Does Machine have three states ? Is string a binary number? Does DFA accept any input? Turing Machine Input problem instance YES N