t2 - T of length 12. (b) Find a string ω ∈ b ( a + b ) *...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
University of Central Florida School of Computer Science COT 4210 Spring 2004 Prof. Rene Peralta T2 1. Put the following grammar in Chomsky Normal Form. S SS + AA A AB + a B BS + b + λ 2. Write a context-free grammar for the following language L = { a n b k a m | m = n + k,m,n,k 0 } . 3. Let M be the following DFA. Write left-linear and right-linear grammars for the language accepted by M. 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4. Eliminate left-recursion from the following grammar S SB + A A AB + a B Ba + b 5. Consider the following languages L = { ωω r ω | ω ( a + b ) * } R = { ω | ω ( a + b ) * and ω has exactly 6 b’s } T = L R (a) Give a string in
Background image of page 2
This is the end of the preview. Sign up to access the rest of the 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; • define 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.

Page1 / 2

t2 - T of length 12. (b) Find a string ω ∈ b ( a + b ) *...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online