Scribd
Upload
29 views

Tut 4

This problem sheet contains 3 questions about formal languages and grammars. Question 1 asks to find grammars that generate specific languages involving strings over the alphabets {a,b}. Question 2 asks to show that recursive languages are closed under union, concatenation and Kleene star operations and the same for recursively enumerable languages. Question 3 asks to show that languages accepted by deterministic pushdown automata with two stacks are precisely the class of recursive languages.

Uploaded by

RakshitTiwari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views

Tut 4

This problem sheet contains 3 questions about formal languages and grammars. Question 1 asks to find grammars that generate specific languages involving strings over the alphabets {a,b}. Question 2 asks to show that recursive languages are closed under union, concatenation and Kleene star operations and the same for recursively enumerable languages. Question 3 asks to show that languages accepted by deterministic pushdown automata with two stacks are precisely the class of recursive languages.

Uploaded by

RakshitTiwari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Problem Sheet 3

April 11, 2017

1. Find grammars that generate teh follwoing languages

 ∗
(a) ww : w ∈ {a, b}
 2n
(b) a :n≥0

2. Show that the class of recursive languages is closed under union, concate-
nation and kleene star. Do the same for recursively enumerable languages.

3. Show that the class of languages accepted by deterministic push down


automata with two stacks is precisely the class of recursive lenguages.

You might also like