This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Spring 10: CSci 4011Formal Languages and Automata Theory 40 points Homework 7 Out Fri., 3/12 Due Fri., 3/26 Please review the instructions given with Homework 1, as they apply to this home work, too. Please hand in your answers to the following. Note: All Exercise/Problem/Theorem/etc. numbers correspond to the U.S. 2nd edition of the Sipser text. If you have the International edition, please check that the numbers match the ones in the U.S. edition. 1. Use the Pumping Lemma for CFLs to prove that A = { n 1 n n 1 n  n } is not contextfree. A careful, wellarticulated answer (similar to examples done in class or in the text) is required. 2. Use the Pumping Lemma for CFLs to prove that the following language is not contextfree. B = { t 1 # t 2 # # t k  k 2 , each t i { a,b } * , and t i = t j for some i negationslash = j } (For instance, 010#01#010, 10#10, and 0#0#0 are all in B , but 00#, 010#110 are not.) A care ful, wellarticulated answer (similar to examples done in class or in the text) is required.ful, wellarticulated answer (similar to examples done in class or in the text) is required....
View Full
Document
 Spring '08
 NADATHUR

Click to edit the document details