hw5 - a n b m c 2 n m | n,m> 3(Sudkamp 3.14 page 84 For...

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

View Full Document Right Arrow Icon
MCS4653, Theory of Computation Homework Assignment 5, Due 10/13/03 Name Student ID Page 1 1. (Sudkamp 3.6 page 83) For each of the following context-free grammars, use set notation to define the language generated by the grammar. a) S aaSB | λ B bB | b b) S aSbb | A A cA | c c) S abSdc | A A cdAba | λ d) S aSb | A A cAd | cBd B aBb | ab e) S aSB | aB B bb | b 2. (Sudkamp 3.8 page 83) Construct a grammar over { a,b,c } whose language is
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 n b m c 2 n + m | n,m > } 3. (Sudkamp 3.14 page 84) For each of the following regular grammars, give a regular expression for the language generated by the grammar. a) S → aA A → aA | bA | b b) S → aA A → aA | bB B → bB | λ c) S → aS | bA A → bB B → aB | λ d) S → aS | bA | λ A → aA | bS...
View Full Document

This note was uploaded on 02/22/2012 for the course CS 480 taught by Professor John during the Spring '12 term at Michigan State University.

Ask a homework question - tutors are online