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: T of length 12. (b) Find a string ω ∈ b ( a + b ) * b of length 6 such that ωωω ∈ T . (c) Give a convincing argument that L is not context-free. Your ar-gument should • use the fact that R is regular; • use the fact that the intersection between a regular language and a CFL is a CFL; • deﬁne a string z ∈ T for which the pumping lemma for CFL’s does not hold; • a concise and convincing explanation of why z cannot be “pumped”. 2...
View Full Document
This note was uploaded on 06/09/2011 for the course COT 4210 taught by Professor Staff during the Spring '08 term at University of Central Florida.
- Spring '08
- Computer Science