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: phism.) b). [20 points] The language L 2 = { n 1 m 2 nm  n m } over = { , 1 , 2 } . Problem 3. [15 points] (This is exercise 4.1.2(b) in both the second and third editions of the textbook.) Prove that { n  n is a perfect cube } is not a regular language. ( Hint: See the solution for Exercise 4.1.2(a).) Problem 4. [15 points] (Exercise 4.2.6(c) in both editions of the textbook.) Show that the regular languages are closed under the following operation: init ( L ) = { w  for some string x, wx is in L } . Hint : It is easiest to start with a DFA for L and perform a construction to get the desired language. Problem 5. [15 points] (Exercise 4.2.1(f) in both editions of the textbook.) Suppose h is the homomorphism from the alphabet { , 1 , 2 } to the alphabet { a, b } dened by: h (0) = a ; h (1) = ab , and h (2) = ba . If L is the language L ( a ( ba ) * ), what is h1 ( L )? Provide a proof to justify your claim. 2...
View
Full
Document
This note was uploaded on 01/12/2010 for the course CS 154 at Stanford.
 '08
 Motwani,R

Click to edit the document details