hw5 - A = { i 1 j 2 k | i 6 = j or j 6 = k or k 6 = i } B =...

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

View Full Document Right Arrow Icon
CS 181 — Winter 2006 Problem Set #5 Formal Languages Due February 20, 2008 Problem 4.1. (10 points) Recall the shufe operator From Homework 2. Prove or disprove: a. Context Free languages are closed under shufe. b. Let L be context Free and R regular. Then the shufe oF L and R is context Free. Problem 4.2. (10 points) ClassiFy the Following languages as context Free or not.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: A = { i 1 j 2 k | i 6 = j or j 6 = k or k 6 = i } B = { w ∈ { , 1 , 2 } * | the number oF 0’s, 1’s and 2’s are all equal } Problem 4.3. (10 points) Let C = { x # y | x,y ∈ { , 1 } * and x 6 = y } . Show that C is context Free by giving both a C±G and a PDA For C ....
View Full Document

This note was uploaded on 06/03/2008 for the course CS 181 taught by Professor Rupak during the Winter '08 term at UCLA.

Ask a homework question - tutors are online