FORMAL LANGUAGE & AUTOMATA THEORY (CS 402)

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

B P PODDAR INSTITUTE OF MANAGEMENT AND TECHNOLOGY

THEORY ASSIGNMENT 1
DUE DATE : 05.04.2014
Note: Make sure to kindly make use of the provided cover sheet format for submission of assignment

1.

Define the type of grammars as per Chomsky Classification.

2.

Let L be the set of all palindromes over (a, b}. Construct the grammar G generating L

3.

Find a Type 1 grammar equivalent to the following grammar given by S aBSc /abc / ,
Ba aB , Bb bb .

4.

Let G = (N, T, P, S) where N = {S, B}, T = {a, b, c}, P has the following production rules :
S aSBc / abc , cb Bc , bB bb . Find L(G).

5.

Let G = (N, T, P, S) where N = {S, A}, T = {a, b, c}, P has the following production rules :
S aSc / aAc , A b . Find L(G).
Draw the derivation tree for the smallest string generated by the grammar.

Department of CSE, BPPIMT

3:10:03 PM 12/28/2014

Page 1 of 1