This preview shows page 1. Sign up to view the full content.
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
This note was uploaded on 01/25/2011 for the course CSE 105 taught by Professor Mr.elienasr during the Spring '10 term at American University of Science & Tech.
 Spring '10
 Mr.ElieNasr

Click to edit the document details