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 understandable. [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 deﬁnitions of allNFA, acceptance of a string w , and language recognized. [4 points] (b) Prove that L is regular if and only if there is an allNFA A such that L ( A ) = L . [6 points] 1...
View
Full Document
 Fall '08
 Viswanathan,M
 class textbook

Click to edit the document details