Scribd
Upload
21 views

TOC Question apaper

Uploaded by

saranyap.aids
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
21 views

TOC Question apaper

Uploaded by

saranyap.aids
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

1. Differentiate NFA and DFA.

2. Convert the given NFA to an DFA.

3. Prove that reversal of any regular language is also regular.

4. Write a regular expression that recognizes the set of all strings (0+1)* that do not contain the
substrings 00 and 11 over the alphabet  = {0,1}.

5. State the Pumping Lemma for Context Free Languages.

6. What is a Deterministic Push Down Automata?

7. Give the instantaneous description of a TM.

8. What do you mean by useless symbol? Explain with an example.

9. When is a language L recursively enumerable?

10. What are tractable problems?

PART – B

11. (a) Construct NFA accepting the set of strings  = {0,1} such that two 0’s are separated by a string
whose length is 4i, for some i>=0. (13)

OR

(b) Prove that for every L recognized by an NFA, there exists an equivalent DFA accepting the same
language L. (13)

12. (a) Prove that regular expressions are closed under union, Concatenation, Kleen Closure,
Complement. (13)

OR

(b)Prove that any language accepted by a DFA can be represented by a regular expression and also
construct a finite automata for the regular expression 10+(0+11)0*1. (13)

13. (a) Let G = (V,E,R,S) be the CFG, where V = {A, B,S}, E = {a,b}, S is the start variable and R consists of
the rules.

S-> aB|bA

A->a|aS|BAA

B->b|bS|ABB
(i) Prove that ababba € L(G) (7)

(ii) Prove that L(G) is the set of all non-empty strings w over the alphabet {a,b} such that the number a’s
in w is equal to the number of b’s in w. (6)

OR

(b) (i) Design a PDA that will accepts strings (a+b)* in which the number of a’s is greater than the
number of b’s given the alphabet  = {a,b}. (7)

(ii) Convert the above PDA to its equivalent CFG. (6)

14. (a) (i) Convert the following grammar to CNF (7)

S-> ASB|€

A-> aAS|a

B->SbS|A|bb

(ii) Design a Turing Machine to compute proper subtraction. (6)

(b) (i) Convert the following grammar to CNF (7)

A1 - > A3A2|A2A3

A2->A3A3|A2A3|a

A3->A2A2|b

(ii) Design a Turing Machine that takes a binary number as input and increments the number by 1. (6)

15. (a) (i) Prove that Post Correspondence Problem is undecidable. (7)

(ii) Write short notes on P and NP completeness. (6)

OR

(b) (i) Explain about Universal Turing Machine. (7)

(ii) Discuss Travelling Salesman Problem in terms of P and NP completeness. (6)

PART – C

16. (a) Consider the NFA N = (Q,,, q, F), where Q = {1,2,3},  = {a,b}, q=1, F = {2}, and  is given by the
following table.
Convert the NFA (N) into DFA (M) that accepts the same language. (15)

(b) (i) Write the regular expression for the set of all strings of 0’s and 1’s not containing 101 as substring.
(5)

(ii) Design a Turing machine to recognize the language {0n1n0n|n>=0}. (10)

You might also like