plugin-midterm09

plugin-midterm09 - L = { w : n a ( w ) + n b ( w ) = n c (...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS530-F09, Midterm Exam Due: Tuesday 20th, 11.25 A.M. 1. Construct either DFA or NFA for the following language. L ( w,x ) = { w 1 x 1 w 2 x 2 ...w n x n : w = w 1 w 2 ...w n L 1 ,x = x 1 x 2 ...x n L 2 } , where L 1 ,L 2 are regular. 2. Prove that the following language is not regular. L = { w ¯ w : w (0 S 1) * , ¯ 0 = 1 , ¯ 1 = 0 } 3. Construct corresponding PDA or CFG to prove each language is context free. (a)
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: L = { w : n a ( w ) + n b ( w ) = n c ( w ) ,w ( a S b S c ) * } , where n a ( w ) ,n b ( w ) ,n c ( w ) represents number of a,b,c in w , respectively. (b) L = { a i b j : j 6 = i V j 6 = 3 i } 4. Prove that the following language is not context free. L = { a n b m : n = 2 m } 1...
View Full Document

Ask a homework question - tutors are online