Scribd
Upload
21 views

TOC Minor 2

1. This document contains questions related to theory of computation. It asks to: - Simplify a context free grammar by removing useless symbols. - Find a regular expression for a given deterministic finite automaton. - Convert a context free grammar to Greibach normal form. 2. It also asks to: - Design a pushdown automaton for a specified language and show its execution. - Construct a context free grammar for the natural language of a given linear bounded automaton. 3. Finally, it asks to: - Design a Turing machine to accept a specific language and show its execution. - State the pumping lemma for regular and context free languages.

Uploaded by

Nidhi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
21 views

TOC Minor 2

1. This document contains questions related to theory of computation. It asks to: - Simplify a context free grammar by removing useless symbols. - Find a regular expression for a given deterministic finite automaton. - Convert a context free grammar to Greibach normal form. 2. It also asks to: - Design a pushdown automaton for a specified language and show its execution. - Construct a context free grammar for the natural language of a given linear bounded automaton. 3. Finally, it asks to: - Design a Turing machine to accept a specific language and show its execution. - State the pumping lemma for regular and context free languages.

Uploaded by

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

B.Engg.

- 5th Semester (Computer Science & Engineering)


Paper CS505: Theory of Computation
Time Allowed: 1.5 Hours Max. Marks: 30
---------------------------------------------------------------------------------------------------------------------------------------
1. (a) For given CFG, find equivalent CFG with no useless symbols.
SAB|AC
AaAb|bAa|a,
BbbA|aaB|AB
CabCa|aDb
DbD|aC (04)
(b) Find the regular expression using Arden’s theorem for the given deterministic finite
automata M = ({ q0, q1, q2, q3,}, {0, 1}, δ, q0, { q3,}) and transition δ is given in
table:
Q/ Σ a b
q0 q1 -
q1 q1 q2
q2 q3 q2
q3 q1 q2
(04)
(c) Convert the following CFG to GNF
E  E+T|T*F|(E)|a, T  T* F|(E)|a, F  (E)|a (04)
2. (a) Design a PDA for the language L = { anb2n | n>1} by empty store. Compute the sequence of execution
by taking suitable string of given language. (05)
(b) Construct a CFG which accepts N(A) where A = ({q0,q1}, {0,1}, {X, Z0}, 𝛿, q0, Z0, }. 𝛿 is given by
(q0, 0, Z0) = {(q0, XZ0)}, (q1, 1, X) = {(q1, є)},
(q0, 0, X) = {(q0, XX)}, (q1, 0, X) = {(q1, є )},
(q0, 1, X) = {(q1, є)}, (q1, є, Z0) = {(q1, є)}. (06)
3. (a) Design a Turing machine that can accept the language L = { 0n12n | n>1}. Compute the sequence of
execution for the string 001111.
(b) State pumping lemma for Regular and Context free languages.
(05+02)

You might also like