This preview shows page 1. Sign up to view the full content.
Unformatted text preview: u  =  v  =  z  , xyuvz L } . Prove that L may not be regular. Question 2 [4 points] Consider the CFG with rules S aSbScS  aScSbS  bSaScS  bScSaS  cSaSbS  cSbSaS  Does this generate the language { x { a, b, c } *  n a ( x ) = n b ( x ) = n c ( x ) } where n a ( x ) (respectively n b ( x ) , n c ( x )) is the number of as (respectively, bs, cs) in string x ? Question 3 [3 points] Describe the language generated by a CFG with rules S aS  aSbS  . Characterize the language by describing a property that every prex of a string in this language must have. Question 4 [3 points] Show using the pumping lemma that the following language is not a CFL: L = { a n b m a n b n + m } . 1...
View Full
Document
 Winter '10
 n

Click to edit the document details