This preview shows page 1. Sign up to view the full content.
Unformatted text preview: CFG is decidable, and that in this problem, you are interested in a recognizer. 6. Exercise 5.4, p. 211. 7. Problem 5.9, p 211. Hint: Show that A TM m T by mapping M, w to a suitable M' , so that M, w A TM M' T. Note that the language T is descriptions of machines that accept w R whenever they accept w. That doesnt mean that your M' has to accept all w and w R ....
View Full Document
This document was uploaded on 02/08/2011.
- Fall '09