Scribd
Upload
30 views

TOC Paper 4

This document contains a question paper for the Theory of Computation exam with the following information: 1) It lists the roll number, question paper number, unique paper code, name of the paper, course, and semester. 2) It provides instructions for candidates regarding answering compulsory questions from Part A and optional questions from Part B. 3) Part A contains 8 short questions worth between 2-4 marks each on topics like regular expressions, finite automata, context-free grammars, and pumping lemma. 4) Part B contains 7 longer answer questions worth between 3-6 marks each on similar topics as well as pushdown automata, Turing machines, and recursively enumerable languages

Uploaded by

Comedy Nights
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
30 views

TOC Paper 4

This document contains a question paper for the Theory of Computation exam with the following information: 1) It lists the roll number, question paper number, unique paper code, name of the paper, course, and semester. 2) It provides instructions for candidates regarding answering compulsory questions from Part A and optional questions from Part B. 3) Part A contains 8 short questions worth between 2-4 marks each on topics like regular expressions, finite automata, context-free grammars, and pumping lemma. 4) Part B contains 7 longer answer questions worth between 3-6 marks each on similar topics as well as pushdown automata, Turing machines, and recursively enumerable languages

Uploaded by

Comedy Nights
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Roll No.

S. No. ofQuestion Paper : S2

Unique Paper Code 32341502

Name ofthe Paper Theory of Computation

Name of the Course B.Sc. (H.)Computer Science

Semester V

Duration:3 Hours Maximum Marks:75

Write your Roll No. onihe topimnediately on receipt of this question paper,)
Instructions for Candidates
(1) Allquestions from Part Aare compulsory. Attempt any
four questions from Part B.
(2) AssumeE= {a b} is the underlying alphabet unless
mentioned otherwise. Parts of a.question must be

answered together.
Part A

(a) Prove that for all sets S, (S)*=S*.

(b) Give regular expression for the language of all strings


that do noi end with double letter. 2

(at) (ab th) atbtd PT0.


( 2 ) S2

languaue
(c) Show that (ab)*a and a(ba)* defines the sane

3
over alplhabet {a b}.

that have
() Build an FA that accepts only th0se words

exactly four letters.

do not
(e) Build an FA that accepts only those words that
4
end with ba.

count={sanghs)
Find a CFG for the language Trailing

4
for all s in (a+b)*}.

language
ig) Use the pumping lemma to show that the

4
Square-{a where n is a square} is non-regular.

(h) Show that if L, and L, are regular language then so are

4
L,tl,, LL, and .*.

i) Construct a PDA for the language L-a"b

4
!2 3..........

Desipn a right sibifin: turing machine.

>L URaL4
3 S2

Part B

2 (a) Detine Regular Expression. 2

(5) Build a reguiar expression tor all words that have odd

no. of b's. (atbatb) Bat 3

(c) Build an FA that accepts all strings that start and end
with different letters.

3 (a) For languages, L.,-(atb)*a and L,-(a+b)*a¥(a tb)*. find


the deterministic finite automata for L, tLy: 6

(b) Show that the following context free grammar is

ambiguous : 4

S->aSb | Sb| Sa a.

4. (a) Use the pumping lemma to show that the language aba"
where. n-1 23... is non-regular. 4

(b) For the given, L,(atb)*a and L,-b{atb)*, find tthe


automata and reyular expression for 1., L,.

5. (u) Consiruct a PDA for the larguage a"b"a"b" where

fr. n !

(b) CoustuuCt : Ci fr he tuoguee (batab)*.


S’bS
52
( 4 )

also recursively
6. (a) Prove that a recursive language is
enumerable.

language ab'a"b
(b) Using pumping lemma prove that the
4
for n 23 .... is non-context free.
language a"b'c where
7. (a) Design a turing machine for the
6
n=12 3
4
(6) Describe "Universal Turing Machine".

C.

a,

4 1,400
S2

You might also like