S. No.

Questions

1. Explain transition diagram, transition table with example.

2. Define transition function of DFA.
3. Define ε –transitions.
4. Construct a DFA to accept even number of 0‟s.
5. Define Kleene closure and positive closure.
6. Construct a DFA to accept empty language.
7. Explain power of an alphabet (∑*)?
8. Write transition diagram for DFA accepting string ending with 00
defined over an alphabet ∑= {0,1}
9. Write transition diagram for DFA to accept exactly one a defined
over an alphabet ∑= {a,b}
10. Define NFA with an example.
11. Explain the different Operations on the languages.
13. Define Moore Machines.
14. Define Mealy Machines.
15. Write DFA for odd number of 1‟s.
16. Write NFA for (0+1)*101(0+1)*.
17. Write DFA for (0+1)*10(0+1)*.
18. Define ɛ - closure.
19. Write NFA for (0+1)*001(0+1)*.
20. Write DFA for (0+1)*00(0+1)*.
21 Define FSM and its structure with an example.
22 Give any two comparisions between NFA and DFA
1. Construct a DFA to accept set of all strings ending with 010. Define
language over an alphabet ∑ = { 0,1} and write for the above DFA .
2. Construct a Moore machine to accept the following
language. L = { w |w mod 3 = 0} on ∑ = { 0,1,2}
3. Write any six differences between DFA and NFA
4. Write NFA with Ɛ to NFA conversion with an example.
5. Construct NFA for (0 + 1)*(00 + 11)(0 + 1)* and Convert to
DFA.
6. Design DFA for the following languages shown below
∑ = { a,b}
a. L={w/ w does not contain the substring ab}
b. L={w/ w contains neither the substring ab nor ba}
c. L={w/ w is any string that doesn‟t contain exactly two a}
d. L={w/ w is any string except a and b}
7. Illustrate given 2 FA„s are equivalent or not with an example.

8. Construct Mealy machine for (0 + 1)*(00 + 11) and convert to Moore

machine.
9. Convert NFA with Ɛ – a*b* to NFA.
10. Construct NFA for (0 + 1)*101 and Convert to DFA.
11. Construct a mealy machine that takes binary number as input and
produces 2‟s complement of that number as output.Assume the string
is read LSB to MSB and end carry is discarded.
12. Explain with the following example the Minimize the DFA .

13. Construct a DFA, the language recognized by the Automaton being L

□ {anb/n  0}. Draw the transition table.
14. Construct the Minimized DFA

15. Construct the DFA that accepts/recognizes the language L(M) = |

w {a, b, c}* and w contains the pattern abac }. Draw the transition table.

16. Construct NFA for given NFA with Є-moves

17. Differentiate between DFA and NFA with an example.

18. Construct a finite automaton accepting all strings over {0, 1}
having
even number of 0‟s and even number of 1‟s.
19. Construct a Moore Machine to determine the residue mod 5 for
each binary string treated as integer. Sketch the transition table.
20. Construct the Moore Machine for the given Mealy machine
1. Define Regular Languages.
2. Define Pumping Lemma for Regular Languages.
3. Write the applications of pumping lemma for regular languages.
4. List any two applications of regular expression.
5. Define Context Free Grammars.
6. Define Left linear derivation.
7. Write regular expression for denoting language containing
empty string.
8. Differentiate left linear and right linear derivations.
9. Write the Context free grammar for palindrome.
10. Define right linear grammars.
11. Define Regular grammars.
12. Write regular expressions for the Set of strings over {0, 1} whose
last two symbols are the same.
13. Define right linear derivation.
14. Define left linear grammars.
15. Write the regular language generated by regular expression
(0+1)*001(0+1)*.
16. Write the Regular Expression for the set of binary strings.
17. Write the derivation of the string aaaa from CFG –
STATE/I a b outpu
t
q0 q1 q2 1
q1 q1 q1 0
q2 q1 q0 1

S a S/A A a
18. Write the derivation of the string 110 from CFG –
SA0/B A0/12/B B A/11
19. Write the Regular Expression to generate atleast one b over
Σ ={a,b}
20. Write the Context free grammar for equal number of a‟s and b‟s.
Long Answer Questions
1. Convert Regular Expression 01* + 1 to Finite Automata.
2. Convert given Finite Automata to Regular Expression using
Arden‟s theorem with an example.

3. Construct Right linear , Left linear Regular Grammars for

01*+1.
4. Explain Identity rules . Simplify the Regular Expression -
Є + 1*(011)*(1*(011)*)*
5. Construct Regular grammar for the given Finite Automata.
(a+b)*ab*.
6. Construct Leftmost Derivation. , Rightmost Derivation,
Derivation Tree for the following grammar
S aB/bA
A a /aS /bAA
B b / bS /aBB
For the string aaabbabbba .
7. Explain the properties, applications of Context Free Languages
8. Construct right linear and left linear grammars for given Regular
Expression.
9. Construct a Transition System M accepting L(G) for a given
Regular
Grammar G.
10. Discuss the properties of Context free Language. Explain the
pumping
lemma with an example.
11. Write regular expressions for the given Finite Automata

12. Construct a NFA with Є equivalent to the regular expression 10 +

(0+ 11)0*1

13. Construct Leftmost Derivation. , Rightmost Derivation,

Derivation Tree for the following grammar G = (V, T, P, S) with
N = {E}, S = E, T = {id, +,*(,)}
E E+E
EE* E
E (E)
E id
Obtain id+id*id in right most derivation, left most derivation
14. Write a CFG that generates equal number of a‟s and b‟s.
15. Convert G = ( {S},{a},{ S  aS /a},{S} ) into FA
16. Construct a Regular expression for the set all strings of 0‟s
and 1‟s with at least two consecutive 0‟s
17. Construct context free grammar which generates palindrome
strings
∑={a,b}
18. Construct equivalent NFA with є for the given regular
expression 0*(1(0+1))*.
19. Construct the right linear grammar for the following

20. Write 12 identity rules for regular expressions

 UNIT – III
Short Answer Questions
1. Define Greibach normal form.
2. Define nullable Variable.
3. Write the minimized CFG for the following
grammar SABCa | bD
ABC |b
Bb | ε
CĐ| ε
Dd
4. Convert the grammar to CNF - S bA/aB AaS/a BbS/b.
5. Explain the elimination of UNIT production.
6. Explain the elimination of useless symbols in productions.
7. Define CNF.
8. Write the minimization of CFG – A a B  aa
S  a S/A
9. Define the ambiguity in CFG.
10. What is the use of CNF and GNF.
11. Write the minimization of CFG - S  aS1b S1aS1b/ɛ.
12. Write the minimization of CFG - S  A A aA/ ɛ.
13. Write the minimization of CFG - A a.
S AB / a
14. Write the minimization of CFG - SaS/A/C A a B aa
CaCb.
15. Write the minimization of CFG - SAbA AAa/ ɛ.
16. Write the minimization of CFG - SaSa S bSb Sa/b/ ɛ.
17. Write the minimization of CFG - SA0/B A0/12/B
B A/11.
18. Convert the grammar to CNF - SaSa/aa SbSb/bb S a/b.
19. Convert the grammar to CNF - SaAbB AaA/a BbB/a.
20. Define PDA.
21. Define NPDA.
22. Differentiate between deterministic and nondeterministic PDA.
23. Define the language of DPDA.
24. List the steps to convert CFG to PDA.
25. Explain – acceptance of PDF by final state.
26. Explain – acceptance of PDF by empty stack.
27. Convert the following PDA to CFG δ(q0,b,z0)={q0,zz0)
28. Convert the following PDA to CFG (q0, b, z)=(q0,zz)
29. Convert the following PDA to CFG δ(q0, ϵ ,z0)=(q0,ϵ)
30. Convert the following PDA to CFG δ(q0,a,z) = (q1,z)
31. Convert the following PDA to CFG δ(q1,b,z)=(q1,ϵ)
32. Convert the following PDA to CFG δ(q1,a,z0)=(q0,z0)
33. Convert the following PDA to CFG δ(q0,0,z0)={q0,xz0)
34. Convert the following PDA to CFG δ(q0,0,x)=(q0,xx)
35. Convert the following PDA to CFG δ(q0,1,x)=(q1,ϵ)
36. Convert the following PDA to CFG δ(q1,1,x) = (q1,ϵ)
37. Convert the following PDA to CFG δ(q1,ϵ,x)=(q1,ϵ)
38. Convert the following PDA to CFG δ(q1,ϵ,z0)=(q1,ϵ)
39. Convert the following PDA to CFG δ(q1,ϵ,z)=(q0,ϵ)
40. Convert the following CFG to PDA S ABC | BbB
41. Convert the following CFG to PDAAaA | BaC|aaa
42. Convert the following CFG to PDA BbBb| a|D
43. Convert the following CFG to PDA C CA|AC
44. Convert the following CFG to PDA Sa S/A
Long Answer Questions
1. Write a short notes on Chomsky Normal Form and Griebach
Normal Form.
2. Show that the following grammar is ambiguous with respect to the
string aaabbabbba.
S aB | bA A
aS| bAA|a
B bS | aBB | b
3. Use the following grammar :
S ABC | BbB
A aA |BaC|aaa
BbBb| a|D
CCA|AC
D ε
Eliminate ε-productions.
Eliminate any unit productions in the resulting grammar.
Eliminate any useless symbols in the resulting grammar.
Convert the resulting grammar into Chomsky Normal Form
4. Illustrate the construction of Griebach normal form with an
example.
5. Show that the following CFG ambiguous.
S iCtS | iCtSeS | a Cb
6. Discuss the Pumnpinngn lemma for Context Free Languages
concept with example {a b c where n>=0}
7. Write the simplified CFG productions in S  a S1b
S1  a S1b/ Є
8. Convert the following CFG into GNF.
SAA/a A  SS/b
9. Explain unit production? Explain the procedure to eliminate unit
production.
10. Explain the procedure to eliminate ϵ-productions in grammar.
11. Convert the following grammar into GNF
G=({A1,A2,A3},{a,b},P,A)
A1->A2A3
A2->A3A1/b
A3->A1A2/a
12. Write simplified CFG productions from the following
grammar A->aBb/bBa
B->aB/bB/ϵ
13. Convert the following grammar into GNF
S->ABA/AB/BA/AA/B
A->aA/a B->bB/b
UNIT – IV
Short Answer Questions
1. Define Turing Machine
2. Explain the moves in Turing Machine.
3. Define an Instantaneous Description of a Turing Machine.
4. Define the Language of Turing Machine.
5. List types of TM.
6. Define Computable Functions by Turing Machines .
7. Write the difference between Pushdown Automata and Turing
Machine.
8. Explain Church‟s Hypothesis.
9. Define Context sensitive language.
10. Define multi head Turing Machine.
11. Define multi dimensional Turing Machine.
12. Define multiple tapes Turing Machine.
13. Define Recursive languages.
14. Define Recursively enumerable languages.
15. Define Two way infinite Turing Machine.
16. Define Non deterministic Turing Machine.
17. Define Counter machine.
18. Explain the model of Turing machine.
19. Construct Turing Machine for 1‟s complement for binary numbers.
20. Differentiate Recursive languages and Recursively enumberable
languages.
Long Answer Questions
1. Define a Turing Machine. With a neat diagram explain the working
of a Turing Machine.
2. Differentiate Turing Machine with other automata.
3. Construct a Transition diagramn fon r nTuring Machine to
accept the following language. L = { 0 1 0 | n ≥1}
4. Construct Transition diagram for Turing Machine that accepts
the language L = {0n1n | n ≥1}. Give the transition diagram for the
Turing Machine obtained and also show the moves made by the
Turing machine for the string 000111.
5. Construct a TransitRion diagram for Turing Machine to accept
the language L= { w#w | w ϵ ( a + b ) *}
6. Write short notes on Recursive and Recursively Enumerable
languages.
7. Write the properties of recursive and recursively enumerable
languages.
8. Construct a Turing Machine to accept strings formed with 0
and 1 and having substring 000.
9. Construct a Turing Machine that accepts the language
L = {1n2n3n | n ≥1}. Give the transition diagram for the Turing
Machine obtained and also show the moves made by the Turing
 machine for the string 111222333.

10. Define Linear bounded automata and explain its model?

11. Explain the power and limitations of Turing machine.
12. Construct Transition diagram for Turing Machine -
L={anbncn/n>=1}
13. Construct a Transition diagram for Turing Machine to implement
addition of two unary numbers(X+Y).
14. Construct a Linear Bounded automata for a language where
L={anbn/n>=1}
15. Explain the types of Turing machines.
16. Write briefly about the following a)Church‟s Hypothesis
b)Counter machine
17. Construct a Transition table for Turing Machine to accept the
following language. L = { 0n1n0n | n ≥1}
UNIT – V
Short Answer Questions
1. Define Chomsky hierarchy of languages.
2. Define Universal Turing Machine
3. Define Context sensitive language.
4. Define decidability.
5. Define P problems.
6. Define Universal Turing Machines
7. Give examples for Undecidable Problems
8. Define Turing Machine halting problem.
9. Define Turing Reducibility
10. Define Post‟s Correspondence Problem.
11. Define Type 0 grammars .
12. Define Type 1 grammars .
13. Define Type 2 grammars .
14. Define Type 3 grammars .
15. Define NP problems.
16. Define NP complete problems
17. Define NP Hard problems
18. Define undecidability problem.
19. Define turing Reducibility.
20. List the types of grammars.
Long Answer Questions
1. Explain the concept of decidable and undecidability problems
about Turing Machines.
2. Write briefly about Chomsky hierarchy of languages..
3. Explain individually classes P and NP
4. Write a shot notes on post's correspondence problem and check
the following is PCP or not.
I A B
1 11 111
2 100 001
3 111 11
5. Explain the Halting problem and Turing Reducibility.
6. Write a short notes on universal Turing machine.
7. Write a short notes on Chomsky hierarchy.
8. Write a short notes on Context sensitive language and linear
bounded
automata.
9. Write a short note on NP complete
10. Write a short note on NP hard problems.
11. Write a short notes on post's correspondence
problem and check the following is PCP or not.
I A B
1 100 1
2 0 100
3 1 0
12. Write a shot notes on post's correspondence problem
and check the following is PCP or not.
I A B
1 00 0
2 001 11
3 1000 011