Unformatted text preview: w } . Prove that L is decidable. Hint: you should be able to detect if M loops forever without ever moving left. Problem 5 Let INFINITE DFA = {h M i M is a DFA that accepts an inﬁnite language } . Prove that INFINITE DFA is decidable. Problem 6 (optional) A 2stack PDA is simply a PDA with two separate stacks instead of one. Prove that the class of languages that can be recognized by 2stack PDAs is the class of Turingrecognizable languages. 131...
View
Full Document
 Spring '10
 Mr.ElieNasr
 Automata theory, lexicographic order, Finite Automata and Theory of Computation

Click to edit the document details