DEPARTMENT OF COPMPUTER SCIENCE AND ENGINEERING

UNIT I
PART A

1. Define Finite Automata.

2. Define NFA.
3. Define DFA.
4. Give the purpose of transition diagram?
5. Define two way finite automata (2DFA).
6. Define equivalence relation.
7. What is the difference between NFA &DFA?
8. Define Regular Expression.
9. Define ԑ-moves/ define finite automata with ԑ-moves.
10. Difference between Moore and Mealy Machines.
11. List out the Applications of Automata Theory?
12. List the applications of computations?
13. Give the Applications of finite Automata?
14. What is meant by Computations?
15. Why switching circuits called as Finite state systems?
16. What are the operations of String?
17. Define Instantaneous description of 2DFA.
18. Construct NFA equivalent to the regular Expression: (0+1)01

PART B
1. Explain the operations on Strings
2. Explain in detail Regular Expressions./prove that for every regular expression there is an
equivalent NFA?
3. Explain DFA with example.
4. Explain NFA with Example.
5. Explain abut Finite Automata with Epsilon ԑ-moves with an example?
6. Write about equivalence of NFA &DFA/ Prove: A language L is Accepted by some ԑ-
NFA if and only if L is accepted by some DFA.
7. Explain Moore and Mealy Machines
8. Explain about 2DFA with example.
9. Write about Minimization of DFA?
10. Give applications of finite automata?
11. Construct a DFA equivalent to NFA, where M = ({q0, q1, q2}, {0, 1, 2}, δ, q0, {q0, q1, q2}).
The Transition is given by the transition diagram and transition table.

Inputs
States
0 1 2
* q0 {q0,q1,q2} {q1,q2} {q2}
* q1 {φ} {q1,q2} {q2}
* q2 {φ} {φ} {q2}

12. Convert the following NFA to equivalent to DFA.

0 1
 {p} {p,q} {p}

{q} {r} {r}

{r} {s} 

*{s} {s} {s}

13. Consider the following -NFA
 a b c
{p}  {p} {q} {r}
{Q} {p} {q} {r} 

*{r} {q} {r}  {p}

a. Compute -Closure of each state.
b. Convert into equivalent DFA.
14. Construct DFA equivalent to NFA where M=({ q0,q1,q2},{0,1,2},δq0,{q0,q1, q2})

0 1 2
q0 q0,q1,q2 q1,q2 q2
q1 ϕ q1,q2 q2
*q2 ϕ ϕ q2
15. Consider the following ε-NFA

ε a b c
{p} {q,r} {q} {r}
{q} ϕ {p} {r} {p,q}
*{r} ϕ ϕ ϕ ϕ
16. Consider the following ε-NFA. Compute ε-Closure for each state and find its Equivalent
DFA

ε a b c
{p} {q} {p} ϕ ϕ
{q} {r} ϕ {q} ϕ
{r} ϕ ϕ ϕ {r}
 DEPARTMENT OF COPMPUTER SCIENCE AND ENGINEERING

UNIT II

PART A
1. What is pumping Lemma?
2. List the applications of pumping Lemma?
3. Define homomorphism with example.
4. Define context free grammar.
5. What is meant by derivations?
6. Define derivation Tree.
7. Define LMD and RMD with example.
8. Define ambiguous grammar.
9. What are the ways to simply context free grammar?
10. Define CNF.
11. Define GNF.
12. What is sentential form?
13. What is closure property of regular sets?
14. Give an example for unambiguous grammar.
15. Eliminate useless productions from the following:
Sa| aA | B| C AaB| ε BAa CcCD Dddd
16. Is the grammar G with following productions ambiguous? Justify.
SSS | aSb | bSa | ε

PART B
1. Describe on Closure Properties of Regular Sets?
2. Show that the language L = { ai bi ci | i>=1} is not context free .
3. Simplify the following grammar and find its equivalent in CNF
SAB | CA, B BC | AB, Aa, C aB | b
4. State and prove Chomsky normal form
5. State and prove Griebach normal form
6. Convert the grammar G with productions to Chomsky normal form
SaSA | aAA | b, A  bBBB, B b | ε
7. State and prove the properties of regular language. Let L be the set of all strings over the
alphabet of the form “x + y = z”, where x, y and z are the binary representation of three
numbers such that the sum of x and y equals z. Prove that the language L is not regular
using the Pumping Lemma.
8. Verify whether { | n>=1} is regular set or not?
9. Convert the following CFG into CNF
S→aXbX
x→aY/bY/ԑ
Y→X/c
10. Explain about Context Free Grammar.
a. Construct CFG representing set of Palindrome over (0+1)*

b. Construct CFG for L= {an/n is odd}

11. Explain about Derivation Tree in detail.
12. Consider the CFG G= ({E, T, F}, {+,*, (,), α}, P, E)
Where P: =E→E+T/T
T→T*F/F
F→ (E)/α
Convert the Grammar into CNF.
13. Construct CFG for the following
L= {an/n is odd}
L= {WcWR/W is string (a+b)*}
 14. Check whether the following is regular or not
a. {0n/n is power of 2/n≥1}
b. {0 n 10n /n≥1}
15. a. Prove {0n1n/n≥1} is regular or not.
b. Prove {01n1/n≥1} is regular or not.
16 a).Show that S→a/Sa/SSb/SbS is ambiguous
b). Derive Left most derivation for the following
S→aB/bA
A→ aS/bAA/a
B→ bS/aBB/b and check for the string aaabbabbba

DEPARTMENT OF COPMPUTER SCIENCE AND ENGINEERING

UNIT III

PART A
1. What is Pushdown Automata?
2. Difference between context free grammar and regular expression.
3. Difference between CFL and PDA.
4. What are the functions of PDA?
5. What is meant by parsing?
6. What are the difficulties in top down parsing?
7. What are the closure properties of CFL?
8. State decision algorithms.
9. Difference between top down and bottom up parsing.
10. State the properties that are not closed under CFl.
11. How can we prove that given language is not CFL?
12. Define PDA accepted by empty stack.
13. What is parse tree give example?

PART B
1. State and explain pushdown automata .Design a PDA for the language anbn over {a,b}
+
.
2. Summarize properties of Context free languages with example.
3. State and prove pumping lemma for CFL.
4. Construct PDA for the language.
L = {ambncm/n>=1,m>=1}
5. Show that {0n1n2n/n>=1} is not context free language.
6. Explain about Top down and Bottom up Parsing.
7. Construct PDA that accepts the language generated by Grammar with productions
S→aSa
S→bSb
S→c and run for the string abcba.
8. Design Push down Automata for the language {anbn/n>=1)
9. Design Push down Automata for the language {0n1n/n>=1)
10. Design Push down Automata for the language {anbn cn /n>=1)
11. Design Push down Automata for the language which accepts palindrome over {a,b}+.

DEPARTMENT OF COPMPUTER SCIENCE AND ENGINEERING

UNIT IV

PART A

1. Define Turing Machine.

2. What is non deterministic Turing Machine?
3. Define basic guidelines for designing a TM.
4. Difference between Recursive and Recursively Enumerable Languages?
5. When a Recursively Enumerable Languages is said to be recursive?
6. What is primitive recursive function?
7. Define recursive languages.
 8. What is multiple track Turing machines?
9. Compare total and partial recursive functions.
10. What is storage in FC?
11. Learn all types of Turing machines.

PART B

1. Explain in detail about the procedure of Turing Machines.

2. Give the techniques for TM constructions?
3. Explain in detail about various types of Turing Machines.
4. Give the properties of Recursive and Recursively Enumerable Languages.
5. Explain Universal Turing Machines.
6. Explain Primitive Recursive Functions.
7. Design Turing machine for the language {anbn/n>=1)
8. Design Turing machine for the language {0n1n/n>=1)
9. Design Turing machine for the language {anbn cn /n>=1)
10. Design Turing machine for the language which accepts palindrome over {a,b}+.

DEPARTMENT OF COPMPUTER SCIENCE AND ENGINEERING

UNIT V
PART A

1. Compare Time and Space Complexity.

2. State the Halting problem of TM.
3. What is running time of TM?
4. Which problem belongs to class NP?
5. What is satisfiability problem?’
6. What are NP classes?
7. Define NP hardness.
8. What is NP completeness?
9. What are P classes?
10. Give real time example for NP hard and NP complete.

PART B

1. Discuss about time and space complexity of TM?

2. Explain NP hard Problems with example.
3. Explain NP complete Problems with example.