www.android.universityupdates.in | www.universityupdates.in | https://telegram.

me/jntuh

X. QUESTION BANK: (JNTUH)

S. No. Questions Blooms

Taxonomy
Level
UNIT - I
Short Answer Questions
1. Explain transition diagram, transition table with example. Understand
2. Define transition function of DFA. Remember
3. Define ε –transitions. Remember
4. Construct a DFA to accept even number of 0’s. Apply
5. Define Kleene closure and positive closure. Remember
6. Construct a DFA to accept empty language. Apply
7. Explain power of an alphabet (∑*)? Understand
8. Write transition diagram for DFA accepting string ending with 00 Apply
defined over an alphabet ∑= {0,1}
9. Write transition diagram for DFA to accept exactly one a defined Apply
over an alphabet ∑= {a,b}
10. Define NFA with an example. Remember
11. Explain the different Operations on the languages. Understand
13. Define Moore Machines. Remember
14. Define Mealy Machines. Remember
15. Write DFA for odd number of 1’s. Apply
16. Write NFA for (0+1)*101(0+1)*. Apply
17. Write DFA for (0+1)*10(0+1)*. Apply
18. Define ɛ - closure. Remember
19. Write NFA for (0+1)*001(0+1)*. Apply
20. Write DFA for (0+1)*00(0+1)*. Apply
21 Define FSM and its structure with an example. Remember
22 Give any two comparisions between NFA and DFA Remember

Long Answer Questions

1. Construct a DFA to accept set of all strings ending with 010. Define Apply
language over an alphabet ∑ = { 0,1} and write for the above DFA .
2. Construct a Moore machine to accept the following Apply
language. L = { w |w mod 3 = 0} on ∑ = { 0,1,2}
3. Write any six differences between DFA and NFA Apply
4. Write NFA with Ɛ to NFA conversion with an example. Understand
5. Construct NFA for (0 + 1)*(00 + 11)(0 + 1)* and Convert to Apply
DFA.
6. Design DFA for the following languages shown below Apply
∑ = { 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}

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

7. Illustrate given 2 FA‘s are equivalent or not with an example. Apply

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

Moore machine.
9. Convert NFA with Ɛ – a*b* to NFA. Understand
10. Construct NFA for (0 + 1)*101 and Convert to DFA. Apply
11. Construct a mealy machine that takes binary number as input and Understand
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 . Understand

13. Construct a DFA, the language recognized by the Automaton being L Apply
{anb/n 0}. Draw the transition table.
14. Construct the Minimized DFA Apply

15. Construct the DFA that accepts/recognizes the language L(M) = | Apply
w {a, b, c}* and w contains the pattern abac }. Draw the transition
table.
16. Construct NFA for given NFA with Є-moves Apply

17. Differentiate between DFA and NFA with an example. Understand

18. Construct a finite automaton accepting all strings over {0, 1} Apply
having
even number of 0’s and even number of 1’s.
19. Construct a Moore Machine to determine the residue mod 5 for Apply
each binary string treated as integer. Sketch the transition table.
20. Construct the Moore Machine for the given Mealy machine
Understand
UNIT – II
Short Answer Questions
1. Define Regular Languages. Remember
2. Define Pumping Lemma for Regular Languages. Remember

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

3. Write the applications of pumping lemma for regular languages. Apply

4. List any two applications of regular expression. Remember
5. Define Context Free Grammars. Remember
6. Define Left linear derivation. Remember
7. Write regular expression for denoting language containing Apply
empty string.
8. Differentiate left linear and right linear derivations. Understand
9. Write the Context free grammar for palindrome. Remember
10. Define right linear grammars. Remember
11. Define Regular grammars. Remember
12. Write regular expressions for the Set of strings over {0, 1} whose Apply
last two symbols are the same.
13. Define right linear derivation. Remember
14. Define left linear grammars. Remember
15. Write the regular language generated by regular expression Apply
(0+1)*001(0+1)*.
16. Write the Regular Expression for the set of binary strings. Apply
17. Write the derivation of the string aaaa from CFG – Apply
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 – Apply
SA0/B A0/12/B B A/11
19. Write the Regular Expression to generate atleast one b over Apply
Σ ={a,b}
20. Write the Context free grammar for equal number of a’s and b’s. Apply
Long Answer Questions
1. Convert Regular Expression 01* + 1 to Finite Automata. Understand
2. Convert given Finite Automata to Regular Expression using Understand
Arden’s theorem with an example.

3. Construct Right linear , Left linear Regular Grammars for Apply

01*+1.
4. Explain Identity rules . Simplify the Regular Expression - Understand
Є + 1*(011)*(1*(011)*)*
5. Construct Regular grammar for the given Finite Automata. Apply
(a+b)*ab*.

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

6. Construct Leftmost Derivation. , Rightmost Derivation, Apply

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 Understand
8. Construct right linear and left linear grammars for given Regular Apply
Expression.
9. Construct a Transition System M accepting L(G) for a given Apply
Regular
Grammar G.
10. Discuss the properties of Context free Language. Explain the Understand
pumping
lemma with an example.
11. Write regular expressions for the given Finite Automata Apply

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

(0+ 11)0*1

13. Construct Leftmost Derivation. , Rightmost Derivation, Apply

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. Apply
15. Convert G = ( {S},{a},{ S  aS /a},{S} ) into FA Understand
16. Construct a Regular expression for the set all strings of 0’s and Apply
1’s with at least two consecutive 0’s
17. Construct context free grammar which generates palindrome Apply
strings
∑={a,b}
18. Construct equivalent NFA with є for the given regular Apply
expression 0*(1(0+1))*.
19. Construct the right linear grammar for the following Apply

20. Write 12 identity rules for regular expressions Apply

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

UNIT – III
Short Answer Questions
1. Define Greibach normal form. Remember
2. Define nullable Variable. Remember
3. Write the minimized CFG for the following grammar Remember
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. Understand
5. Explain the elimination of UNIT production. Understand
6. Explain the elimination of useless symbols in productions. Understand
7. Define CNF. Remember
8. Write the minimization of CFG – A a B  aa Understand
S  a S/A
9. Define the ambiguity in CFG. Remember
10. What is the use of CNF and GNF.
11. Write the minimization of CFG - S  aS1b S1aS1b/ɛ. Understand
12. Write the minimization of CFG - S  A A aA/ ɛ. Understand
13. Write the minimization of CFG - A a. Understand
S AB / a
14. Write the minimization of CFG - SaS/A/C A a B aa Understand
CaCb.
15. Write the minimization of CFG - SAbA AAa/ ɛ. Understand
16. Write the minimization of CFG - SaSa S bSb Sa/b/ ɛ. Understand
17. Write the minimization of CFG - SA0/B A0/12/B Understand
B A/11.
18. Convert the grammar to CNF - SaSa/aa SbSb/bb S a/b. Understand
19. Convert the grammar to CNF - SaAbB AaA/a BbB/a. Understand
20. Define PDA. Remember
21. Define NPDA. Remember
22. Differentiate between deterministic and nondeterministic PDA. Understand
23. Define the language of DPDA. Remember
24. List the steps to convert CFG to PDA. Remember
25. Explain – acceptance of PDF by final state. Understand
26. Explain – acceptance of PDF by empty stack. Understand
27. Convert the following PDA to CFG δ(q0,b,z0)={q0,zz0) Apply
28. Apply
Convert the following PDA to CFG (q0, b, z)=(q0,zz)
29. Apply
Convert the following PDA to CFG δ(q0, ϵ ,z0)=(q0,ϵ)
30. Apply
Convert the following PDA to CFG δ(q0,a,z) = (q1,z)
31. Convert the following PDA to CFG δ(q1,b,z)=(q1,ϵ) Apply
32. Convert the following PDA to CFG δ(q1,a,z0)=(q0,z0) Apply
33. Convert the following PDA to CFG δ(q0,0,z0)={q0,xz0) Apply
34. Convert the following PDA to CFG δ(q0,0,x)=(q0,xx) Apply

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

35. Convert the following PDA to CFG δ(q0,1,x)=(q1,ϵ) Apply

36. Convert the following PDA to CFG δ(q1,1,x) = (q1,ϵ) Apply
37. Convert the following PDA to CFG δ(q1,ϵ,x)=(q1,ϵ) Apply
38. Convert the following PDA to CFG δ(q1,ϵ,z0)=(q1,ϵ) Apply
39. Convert the following PDA to CFG δ(q1,ϵ,z)=(q0,ϵ) Apply
40. Convert the following CFG to PDA S ABC | BbB Apply
41. Convert the following CFG to PDAAaA | BaC|aaa Apply
42. Convert the following CFG to PDA BbBb| a|D Apply
43. Convert the following CFG to PDA C CA|AC Apply
44. Convert the following CFG to PDA Sa S/A Apply
Long Answer Questions
1. Write a short notes on Chomsky Normal Form and Griebach Apply
Normal Form.
2. Show that the following grammar is ambiguous with respect to the Understand
string aaabbabbba.
S aB | bA
A aS| bAA|a
B bS | aBB | b
3. Use the following grammar : Apply
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 Apply
example.
5. Show that the following CFG ambiguous. Apply
S iCtS | iCtSeS | a Cb
6. Discuss the Pumping lemma for Context Free Languages concept Understand
with example {anbncn where n>=0}
7. Write the simplified CFG productions in S  a S1b Apply
S1  a S1b/ Є
8. Convert the following CFG into GNF. Understand
SAA/a A  SS/b
9. Explain unit production? Explain the procedure to eliminate unit Understand
production.
10. Explain the procedure to eliminate ϵ-productions in grammar. Understand
11. Convert the following grammar into GNF Understand
G=({A1,A2,A3},{a,b},P,A)
A1->A2A3
A2->A3A1/b
A3->A1A2/a

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

12. Write simplified CFG productions from the following Apply

grammar A->aBb/bBa
B->aB/bB/ϵ
13. Convert the following grammar into GNF Understand
S->ABA/AB/BA/AA/B
A->aA/a B->bB/b
UNIT – IV
Short Answer Questions
1. Define Turing Machine Apply
2. Explain the moves in Turing Machine. Understand
3. Define an Instantaneous Description of a Turing Machine. Remember
4. Define the Language of Turing Machine. Remember
5. List types of TM. Remember
6. Define Computable Functions by Turing Machines . Remember
7. Write the difference between Pushdown Automata and Turing Apply
Machine.
8. Explain Church’s Hypothesis. Understand
9. Define Context sensitive language. Remember
10. Define multi head Turing Machine. Remember
11. Define multi dimensional Turing Machine. Remember
12. Define multiple tapes Turing Machine. Remember
13. Define Recursive languages. Remember
14. Define Recursively enumerable languages. Remember
15. Define Two way infinite Turing Machine. Remember
16. Define Non deterministic Turing Machine. Remember
17. Define Counter machine. Remember
18. Explain the model of Turing machine. Remember
19. Construct Turing Machine for 1’s complement for binary numbers. Remember
20. Differentiate Recursive languages and Recursively enumberable Remember
languages.
Long Answer Questions
1. Define a Turing Machine. With a neat diagram explain the working Remember
of a Turing Machine.
2. Differentiate Turing Machine with other automata. Apply
3. Construct a Transition diagramn for Turing Machine to accept Apply
the following language. L = { 0 1n0n | n ≥1}
4. Construct Transition diagram for Turing Machine that accepts Apply
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 Transition diagram for Turing Machine to accept the Apply
language L= { w#wR | w ϵ ( a + b ) *}
6. Write short notes on Recursive and Recursively Enumerable Apply
languages.
7. Write the properties of recursive and recursively enumerable Apply
languages.
8. Construct a Turing Machine to accept strings formed with 0 Apply
and 1 and having substring 000.

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

9. Construct a Turing Machine that accepts the language Apply

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? Apply
11. Explain the power and limitations of Turing machine. Create
12. Construct Transition diagram for Turing Machine - Apply
L={anbncn/n>=1}
13. Construct a Transition diagram for Turing Machine to implement Apply
addition of two unary numbers(X+Y).
14. Construct a Linear Bounded automata for a language where Apply
n n
L={a b /n>=1}
15. Explain the types of Turing machines. Apply
16. Write briefly about the following a)Church’s Hypothesis Apply
b)Counter machine
17. Construct a Transition table for Turing Machine to accept the Apply
following language. L = { 0n1n0n | n ≥1}
UNIT – V
Short Answer Questions
1. Define Chomsky hierarchy of languages. Knowledge
2. Define Universal Turing Machine Knowledge
3. Define Context sensitive language. Knowledge
4. Define decidability. Knowledge
5. Define P problems. Knowledge
6. Define Universal Turing Machines Knowledge
7. Give examples for Undecidable Problems Understand
8. Define Turing Machine halting problem. Knowledge
9. Define Turing Reducibility Knowledge
10. Define Post’s Correspondence Problem. Knowledge
11. Define Type 0 grammars . Knowledge
12. Define Type 1 grammars . Knowledge
13. Define Type 2 grammars . Knowledge
14. Define Type 3 grammars . Knowledge
15. Define NP problems. Knowledge
16. Define NP complete problems Knowledge
17. Define NP Hard problems Knowledge
18. Define undecidability problem. Knowledge
19. Define turing Reducibility. Knowledge
20. List the types of grammars. Knowledge
Long Answer Questions
1. Explain the concept of decidable and undecidability problems Understand
about Turing Machines.
2. Write briefly about Chomsky hierarchy of languages.. Apply
3. Explain individually classes P and NP Understand

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

4. Write a shot notes on post's correspondence problemand check the Apply

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. Understand
6. Write a short notes on universal Turing machine. Apply
7. Write a short notes on Chomsky hierarchy. Apply
8. Write a short notes on Context sensitive language and linear Apply
bounded
automata.
9. Write a short note on NP complete Apply
10. Write a short note on NP hard problems. Apply
11. Write a shot notes on post's correspondence problem Apply
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 Apply
and check the following is PCP or not.
I A B
1 00 0
2 001 11
3 1000 011

XI. OBJECTIVE QUESTIONS:

UNIT –I
Multiple Choice Questions
1. The prefix of abc is _ _ _ _ _
a. c b. b c. bc d.a
2.Which of the following is not a prefix of abc?
a.e b. a c. ab d. bc
3.Which of the following is not a suffix of abc ?
a.e b.c c.bc d.ab
4.Which of the following is not a proper prefix of doghouse ?
a.dog b.d c.do d.doghouse
5.If then the number of possible strings of length 'n' is
a.n b.n * n c.n n d.2 n

Fill in the Blanks

1. Language is a set of strings.
2. String is a finite sequence of symbols.
3. The basic limitation of FSM is that it can't remember arbitrary large amount of
information
4. Application of Finite automata is Lexical analyzer

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

5. An FSM can be used to add two given integers .This is false

UNIT –II
Muiltile Choice Questions
1. In case of regular sets the question ' is the intersection of two languages a language of the
same type ?' is _ _ _ _
a. Decidable b. Un decidable c. trivially decidable d. Can't say
2. In case of regular sets the question ' is L1 n L2 = F ? ' is _ _ _
a.Decidable b.Undecidable c.trivially decidable d.Can't say
3. Let r and s are regular expressions denoting the languages R and S. Then (r + s) denotes _ _
a.RS b.R* c.RUS d.R+
4. Let r, s, t are regular expressions. ( r* )* = _ _
a.r b.r* c.F d.can’t say
5. Let r, s, t are regular expressions. r( s+ t) = _ _ _ _
a.r s b.r t c.rs - r t d.rs +r t
Fill in the Blanks
1. Let r, s, t are regular expressions. (r + s) t = r t +st
2. In NFA for r=e the minimum number of states are1
3. ( e + 00 )* =(00)*
4. 1 + 01 =(e + 0) 1
5. 'The regular sets are closed under union' is true

UNIT –III
Multiple Choice Questions
1. Regular grammars also known as _ _ _ _ _ _ _ _ _ _ _ _ grammar
a.Type 0 b.Type 1 c.Type 2 d.Type3
2. _ _ _ _ _ grammar is also known as Type 3 grammar.
a.un restricted b.context free c.context sensitive d.regular grammar
3. Which of the following is related to regular grammar ?
a.right linear b.left linear c.Right linear & left linear d.CFG
4. Regular grammar is a subset of _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ grammar.
a.Type 0 . b.Type 1 c.Type 2 d.Type 0,1 &2
5. Let L1 =(a+b) * a L2 =b*(a+b), L1 intersection L2 = _ _ _ _ _ _ _ _ _ _
a.(a+b) * ab b.ab ( a+b) * c.a ( a+b) * b d.b( a+b)*a
Fill in the Blanks
1. Let A = {0,1 } L= A * Let R = { 0 n1n , n >0 } then LUR regular
2. Pumping lemma is generally used for proving a given grammar is not regular
3. The logic of pumping lemma is a good example of the pigeon hole principle
4. In CFG each production is of the form Where A is a variable and is string of Symbols from
*(VUT) ( V, T are variables and terminals )
5. CFG is not closed under complementation

UNIT –IV
Multiple Choice Questions
1. Turing machine can be used to
a.Accept languages b.Compute functions c.a & b d.none
2. Any turing machine is more powerful than FSM because____
a.Tape movement is confined to one direction
b.It has no finite state control

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh

 www.android.universityupdates.in | www.universityupdates.in | https://telegram.me/jntuh

c.It has the capability to remember arbitrary long input symbols

d.TM is not powerful than FSM
3. In which of the following the head movement is in both directions
a.TM b.FSM c.LBA d.a& c
4.A turing machine is
a.Recursively enumerable language b.RL c.CFL d.CSL
5. Any Turning machine with m symbols and n states can be simulated by another TM with just 2
s symbols and less than
a.8mn states b.4mn+8states c.8mn+ 4 states d.mn states
Fill in the Blanks
1. The format: A->aB refers to Greibach Normal Form
2. Greibach Normal Form does not have left recursions.
3. Every grammar in Chomsky Normal Form is context free
4. Let G be a grammar. When the production in G satisfy certain restrictions, then G is said to be
in normal form
5. Let G be a grammar: S->AB|e, A->a, B->b, Is the given grammar in CNF(True/False) True.

UNIT –V
Multiple Choice Questions
1.PCP having no solution is called
a. undecidability of PCP b.decidability of PCP c.Semi-decidability of PCP d None
2. Which of the following is type- 2 grammar?
a.A→ α where A is terminal b.A→ α where A is Variable c.Both d.None
3. A recursive language is also called
a) Decidable b) Undecidable c) Both (a) and (b) d) None of these
4. The complement of recursive language is
a) Also recursive b) Regular c) Both (a) and (b) d) None of these
5. Recursively enumerable language are closed under
a) Concatenation b) Intersection c) Union d) All of these
Fill in the Blanks
1. Recursive languages are Accepted by turing machine
2. Halting problem & Boolean Satisfiability problem are unsolvable?
3. The value of n if turing machine is defined using n-tuples: 7
4. If d is not defined on the current state and the current tape symbol, then the machine halts
5. A language L is said to be decidable if there is a turing machine M such that L(M)=L and M
halts at every point.

www.android.previousquestionpapers.com | www.previousquestionpapers.com | https://telegram.me/jntuh