Quiz4Soln

Quiz4Soln - b |y|> 0 c xy i z ∈ L for all i = 0 1 2 …(3(3 points What language is accepted by the following CFG The alphabet for this NFA

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

View Full Document Right Arrow Icon
CSCI 2670 Intro. to Theory of Comp. Quiz 4 9/20/05 Name: ___solution_____________ (1) (4 points) Write a regular expression R such that L(R) = {w | w {a,b}* and w has an even number of a’s}. b*( ab*ab*)* (2) (3 points) What are the properties of x, y, and z in the pumping lemma? a. |xy| ≤ p
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: b. |y| > 0 c. xy i z ∈ L for all i = 0, 1, 2, … (3) (3 points) What language is accepted by the following CFG? The alphabet for this NFA is {a,b} and the start variable is S. S → aSb | bTa | ε T → aT | bT | ε ε∪ a n bxab n , where x is any string in {a,b}*...
View Full Document

This note was uploaded on 02/07/2011 for the course CS 501 taught by Professor Sm during the Spring '11 term at Indiana.

Page1 / 2

Quiz4Soln - b |y|> 0 c xy i z ∈ L for all i = 0 1 2 …(3(3 points What language is accepted by the following CFG The alphabet for this NFA

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