CFL - c k | m ≥ k ∧ n ≥ 5 ∧ m,n,k ∈ N } 8. { a m...

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

View Full Document Right Arrow Icon
Undergraduate Course Elements of the Computation Theory College of Computer Science Context-free Language Zhejiang University Guiz Fall-Winter, 2008 I. Tell whether the following languages are context free or not, explain you answer briefly. 1. { a m b n | 2 n = 3 m,m,n N } 2. { a 3 m b 2 n | m,n N } 3. { a n b 2 n c n +2009 | n N } 4. { a m b n c k | m n ( mod 3) n k ( mod 3) m,n,k N } 5. { a m b n c k | m + n = k m,n,k N } 6. { a m b n c k | m = n,n = k,m,n,k N } 7. { a m b n
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: c k | m ≥ k ∧ n ≥ 5 ∧ m,n,k ∈ N } 8. { a m b n c k | n > m + k ∧ m,n,k ∈ N } II. PDA and Context-free languages: 1. Give a context-free grammar that generates language L = { uu R cvv R | u,v ∈ { a,b } * } . 2. Design a PDA M = ( K, Σ , Γ , Δ ,s,F ) accepting the language L ....
View Full Document

This note was uploaded on 01/23/2012 for the course CS 220 taught by Professor Xiaogangjin during the Spring '09 term at Zhejiang University.

Ask a homework question - tutors are online