This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Homework Problems Problem 1 . [Category: Design] Design an NFA for the language D given in Problem 1.48. You need not formally prove the correctness of your construction, but your construction should be clear and understand-able. [10 points] Problem 2 . [Category: Design] Problem 1.31. Hint: Show that if M is a DFA recognizing A then there is an NFA recognizing A R . [10 points] Problem 3 . [Category: Comprehension+Proof] Read problem 1.38. (a) Give formal denitions of all-NFA, acceptance of a string w , and language recognized. [4 points] (b) Prove that L is regular if and only if there is an all-NFA A such that L ( A ) = L . [6 points] 1...
View Full Document
This note was uploaded on 10/04/2011 for the course CS 373 taught by Professor Viswanathan,m during the Fall '08 term at University of Illinois, Urbana Champaign.
- Fall '08