Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
PART-A
11. Construct a minimized DFA for the RE 10+ (0+11)0*1. (Nov/Dec 2014)
12. Show that L= {0n2 /is an integer, n1} is not regular. (Nov/Dec 2014)
13. Explain the DFA minimization algorithm with an example. (Nov/Dec 2014)
14. Design a DFA accepts the following strings over the alphabets {0, 1} The Set of all
strings that contains a pattern 11. Prove this using mathematical induction.
(May/June 2015)
15. Design a NFA accepts the following strings over the alphabets {0, 1}. The set of all
string that begins with 01 and end with 11. Check for the validity of 01111 and
0110 strings. (May/June 2015)
16. Find the min-state DFA for (0+1)*10. (May/June 2015)
17. Find the regular expression of a language that consist of set of string starts with
11 as well as ends with 00 using Rij formula.(May/June 2015)
18. Construct a DFA accepting all strings w over {0,1} such that the number of 1s in
w is 3 mod 4 (Nov/Dec 2011)
19. Construct a minimized DFA from the regular expression (x+y) x (x+y)*. Trace for a
string w=xxyx.(Nov/Dec 2011)
20. State and explain the conversion of DFA into regular expression using Ardens
theorem. Illustrate with an example.(Nov/Dec 2011)
(+2)
21. Prove by induction on n that =0 = 2 (Apr/May 2012)
22. Construct a DFA accepting binary strings such that the third symbol form the
right end is . (Apr/May 2012)
23. Construct a NFA without -transitions for the NFA given below. (Apr/May 2012)
33. Construct DFA to accept the language L={w| w is of even length and begins with
11} ( Apr/May 2013)
34. Construct a DFA that accept the following language.
{x {a,b}|x|a = odd and |x|b =even. (Nov/Dec 2012)
35. Construct a non deterministic finite automaton for accepting the set of strings over
{a,b} ending in aba. Use it to construct a DFA accepting the same set of strings.
(Apr/May 2014)
36. Construct a NFA with moves which accepts a language consisting the strings of
any number of as, followed by any number of bs, followed by any number of cs.
(Apr/May 2014)
37. Explain the steps in conversion of NFA to DFA. Convert the following NFA to DFA.
(Nov/Dec 2013)
47. Using pumping lemma for the regular sets, prove that the language L={a mbn|m>n}
(Nov/Dec 2012)
48. Prove any two closure properties of regular languages. (Nov/Dec 2012)
49. Construct a minimized DFA that can be derived from the following regular
expression 0*(01)(0/111)*. (Nov/Dec 2012)
50. Design a finite automaton for the regular expression (0+1)*(00+11)(0+1*).
(May/June 2014)
51. Prove that L={0 i2/i is an integer; i 1} is not regular. (May/June 2014)
52. Prove that the class of regular sets is closed under complementation. (May/June
2014)
53. Let r be a regular expression. Prove that there exists an NFA with -transitions
that accepts L(r). (Nov/Dec 2010)
54. Is the language L= {anbn|n1} is regular? Justify. (Nov/Dec 2010)
55. Construct the minimal DFA for the regular expression (b|a)*baa. (Nov/Dec 2010)
56. Prove that regular sets are closed under substitution. (Nov/Dec 2010)
57. State and explain the conversion of DFA to regular expression using Ardens
theorem. Illustrate with an example. (Nov/Dec 2013)
58. Convert the following NFA into a regular expression.(Nov/Dec 2013)
PART-B
1. Construct a reduced grammar equivalent to the grammar G=(N,T,S,P)
Where N={S,A,C,D,E}, T={a,b}, P={S aAa, ASb, AbCC, ADaA, Cabb,CDD,
EaC, DaDA}. (May/June 2016)
2. When is a grammar said to be ambiguous? Explain with the help of an example.
(May/June 2016)
3. Show the derivation steps and construct derivation tree for the string ababbb by
using LMD with grammar S AB| , A aB, BSb. (May/June 2016)
4. What is the purpose of normalization? Construct the CNF and GNF for the
following grammar and explain the steps. S aAa|bBb|, A C|a,BC|b,
CCDE| , DA|B|ab. (May/June 2016)
5. Construct a CFG for the regular expression (011+1)(01). (May/June 2016)
6. let G=(V,T,P,S) be context free grammar then prove that if the recursive inference
procedure tells us that terminal string W is in the language of variable A, then there is
a parse tree with root A and yield w. (Nov/Dec 2015)
7. Given the grammar G= (V, ,R, E) where
V={E,D,1,2,3,4,5,6,7,8,9,0,+,_,*,/,(,)},
={1,2,3,4,5,6,7,8,9,0,+,_,*,/,(,)}, and R contains the following rules
E D|(E)|E+E|E-E|E*E|E/E
D--> 0|1|2|....9. Find a parse tree for the string 1+2*3. (Nov/Dec 2015)
8. Construct a equivalent grammar G in CNF for the grammar G1
where G1=({S,A,B},{a,b},{s-->ASB|e,A-->aAS|a,B-->SbS|A|bb},S) (Nov/Dec 2015)
9. What is an ambiguous grammar? Explain with a example. (Nov/Dec 2015)
10. Given the CFG G, find CGF G in CNF generating the language.L(G)-{^)
S-> AACD, A-> aAb|^, C->aC|a, D-> aDa|bDb|^. (May/June 2015)
11. If G is the grammar S->SbS/a show that G is ambiguous. (May/June 2014)
12. Write a grammar G to recognize all prefix expressions involving all binary
arithmetic operators. Construct a parse tree for the sentence -*+abc/de using G?
(Nov/Dec2014)
13. Show that the following grammar G is ambiguous S->SbS/a. (Nov/Dec 2014)
14. Construct a context free grammar for {0m1n/1mn} (Nov/Dec 2014)
15. Find a grammar G in CNF form equivalent to G
S->aAD, A->aB/bAB, B->b, D->d. (Nov/Dec 2014)
16. Convert the grammar S->0S1/A;A->1A0/S/ into PDA that accepts the same
language by empty stack .Check whether 0101 belongs to N(M). (May/June 2014)
17. Convert to GNF the grammar G, G=({A1,A2,A3},{ab},P,A1} where P consists of the
following A1->A2A3 , A2->A3A1/b, A3->A1A2/a. (Nov/Dec 2014)
18. Explain about Parse trees. For the following grammar (May/June 2013)
S->aB/bA
A->a/aS/bAA
B->b/bS/aBB For the String aaabbabbba ,Find
(1)Leftmost derivation
(2)Rightmost derivation
(3)Parse tree
19. Convert the following grammar into GNF
S->XY1/0
X->00X/Y
Y->1X1 (Nov/Dec 2013)
20. Show that the following grammars are ambiguous.
{S->aSbS/bSaS/} and
{S->AB/aaB,A->a/Aa,B->b} (Nov/Dec 2013)
PART-A
1. State the classes of P problem with an example. (May/June 2016)
2. State when a problem is said to be decidable and give an example of an undecidable
problem. (Nov/Dec 2015)
3. What is a Universal Language Lu? (Nov/Dec 2015)
4. When a recursively enumerable language is is said to be recursive? (May/June 2016)
5. Identify whether Tower of Hanoi problem is tractable or intractable. Justify your
answer.(May/June 2016)
6. Give examples for NP-complete problems. (Nov/Dec 2014)
7. Define RE language. (May/June 2015)
8. Differentiate recursive and non-recursive languages. (May/June 2015)
9. What do you mean by universal turing machine?
10. What are the features of universal turing machine?
11. What are the features of a Universal Turing Machine? (MAY/JUNE-2007)
12. When a language is said to be recursively enumerable? (MAY-2014)
13. Define the classes P and NP. (MAY/JUNE-2011)
14. What is (a) recursively enumerable languages (b) recursive sets? (NOV/DEC-2013)
15. What is universal Turing machine? (NOV/DEC-2013)
16. What is meant by recursively enumerable language?(MAY-2013, NOV-2012, MAY-2012, NOV-2010)
17. Define the class NP problem. (MAY/JUNE-2013)
18. When we say a problem is decidable? Give an example of undecidable problem.
(NOV/DEC-2012)
19. Mention the difference between P and NP problems. (MAY/JUNE-2012)
20. How to prove that the Post Correspondence problem is Undecidable? (NOV/DEC-2011)
21. Show that any PSPACE-hard language is also NP-hard. (NOV/DEC-2011)
22. Prove that the complement of recursive languages is recursive. (MAY/JUNE-2011)
23. Mention the difference between decidable and undecidable problems. (NOV/DEC-2010)
24. State Rices theorem. (MAY/JUNE-2010)
25. Show that the collection of all Turing machines is countable. (MAY/JUNE-2010)
26. When do you say a problem is NP-Hard? (NOV/DEC-2009)
27. State two languages, which are not recursively enumerable. (NOV/DEC-2009,
NOV/DEC-2008)
28. Prove that the theorem: If L is a language generated by some TM M1, then L is
recursively enumerable set. (MAY/JUNE-2009)
29. Define Posts Correspondence problem. (MAY/JUNE-2009, MAY/JUNE-2008)
30. Define Diagonal Language. (NOV/DEC-2008, NOV/DEC-2007)
31. What is meant by halting problem? (MAY/JUNE-2008)
32. What are useless symbols in a grammar? (NOV/DEC-2007)
33. Differentiate between recursive and recursively enumerable languages. (MAY/JUNE-
2007)(May/June 2016)
34. Mention any two undecidability properties for recursively enumerable languages.
(MAY/JUNE-2007)
35. Show that the following problem is undecidable. Given two CFGs G1 and G2, is
L (G1) L (G2) = ? (NOV/DEC-2006)
36. Define Ld. (NOV/DEC-2006)
37. Is it true that complement of a recursive language is recursive? Justify your answer.
38. When a language is said to be recursive? Is it true that every regular set is not recursive?
39. When a problem is said to be decidable or undecidable? Give an example of an
undecidable.
40. State the difference between tractable and intractable problems?
41. Define MPCP.
42. Difference between Initial and composition function.
PART-B
1. Show that the union of two recursive language is recursive and union of two recursively
enumerable languages is recursive. (Nov/Dec 2014)
2. Define the language Lu and show that Lu is RE language. (Nov/Dec 2014)
3. State and prove Post Correspondence Problem and Give example. (Nov/Dec 2014)
4. Explain post-correspondence problems and decidable and undecidable problems with
examples. (May/June 2015)
5. Explain the class P and NP problems with suitable examples. (May/June 2015)
6. Define diagonalization language. S.T the language Ld is not a recursively enumerable
language. (MAY-14)
7. Prove that the universal language is recursively enumerable. (MAY-2014)
8. Define Post Correspondence problem. Let = {0, 1}. Let A and B be the lists of three
strings each, defined as
List A List B
i wi xi
1 1 111
2 10111 10
3 10 0
Does this PCP have a solution? (MAY-2014, MAY/JUNE-2007)
9. Write the classes and definition of NP problem. (NOV/DEC-2013, NOV/DEC-2012)
10. Prove that for two recursive languages L1 and L2 their union and intersection is
recursive. (NOV/DEC-2013, NOV/DEC-2012)
11. Prove that if a language is recursive if and only if it and its complement are both
recursively enumerable. (NOV/DEC-2013)
12. Explain about undecidability of PCP. (NOV/DEC-2013)
13. Explain about A language that is not Recursively Enumerable. (MAY/JUNE-2013)
14. Prove Lne is recursively enumerable. (MAY/JUNE-2013)
15. Discuss on undecidable problems about Turing Machine. (MAY/JUNE-2013,
MAY/JUNE-2012)
16. Explain about the PCP. (MAY/JUNE-2013, NOV/DEC-2012, NOV/DEC-2010)
17. Explain undecidability with respect to Post Correspondence problem. (MAY/JUNE-2012)
18. Discuss the properties of recursive languages. (MAY/JUNE-2012)
19. Discuss the difference between NP-complete and NP-hard problems. (MAY/JUNE-2012)
20. Let = {a, b}*. Let A and B be lists of three strings as given below: A={b, bab3, ba}; B= {b3,
ba, a}. Does this instance of PCP have a solution? Justify your answer. (NOV/DEC-2011,
MAY/JUNE-2007)
21. Write short notes on: (NOV/DEC-2011)
i. Recursive and recursively enumerable languages.
ii. NP hard and NP complete problems.
22. Prove that the universal language Lu is recursively enumerable but not recursive. Also
prove that Ld is not recursive or recursively enumerable.(MAY/JUNE-2011, NOV/DEC-2009)
23. Prove that PCP problem is undecidable and explain with an example. (MAY/JUNE-2011)
24. Explain the difference between tractable and intractable problems with examples.
(NOV/DEC-2010)
25. Explain any four NP-Complete problems. (8) (NOV/DEC-2010)
26. Consider the language of all TMs that given no input eventually write a nonblank symbol
on their tapes. Explain why this set is decidable. Why does this not conflict with the halting
problem? (8) (MAY-2010)
27. Prove that the Post Correspondence Problem is decidable for strings over the alphabet (0).
(8) (MAY/JUNE-2010)
28. Prove that the problem of determining if the languages generated by two CFGs are equal
is undecidable. (8) (MAY/JUNE-2010)
29. Prove that the Punchcard Puzzle is NP-Complete. (8) (MAY/JUNE-2010)
30. State and prove Rices theorem for recursively enumerable index sets. (NOV/DEC-2009)
31. Prove the theorem: If L1 and L2 are two recursive languages then L1 L2 is also
recursive language. If L1 and L2 are two recursively enumerable languages then L1 L2 is
also recursively enumerable languages. (MAY/JUNE-2009)
32. Prove the theorem:The complement of a recursive language is recursive.(MAY/JUNE-2009)
33. Prove that Lu is recursively enumerable. (MAY/JUNE-2009)
34. Prove that Lu is not recursive. (8) (MAY/JUNE-2009)
35. What are undecidable problems? Explain the same using Post Correspondence Problem
(PCP). Does a PCP solution exist for the following set.(10,101) (01,100) (0,10) (100,0) (1,010)
(May/June 2016)
36. State and explain any four applications of NP complete problems. (May/June 2016)
37. Prove that if L1 and L2 are recursively enumerable language over , then L1UL2 and
L1L2 are also recursively enumerable. (May/June 2016)
38. What is a Universal Turing machine? Bring out its significance. Also construct a Turing
machine to add two numbers and encode it. (May/June 2016)
39. What is a Post Correspondence Problem (PCP)? Explain with the help of an example.
(May/June 2016)
40. Prove that MPCP reduce to PCP.(Nov/Dec 2015)
41. Discuss about the tractable and intractable problems. (Nov/Dec 2015)
42. State and explain RICE theorem. (Nov/Dec 2015)
43. Describe about Recursive and Recursively Enumerable Languages with examples.
(Nov/Dec 2015)