Question Bank

Theory of Computation (UCS20004)

SHORT ANSWER QUESTIONS
1) Define Deterministic Finite Automaton (DFA).

2) Define Finite Sate Machine with example

3) List any two applications of FSM used in real life.

4) Identify the regular expression for the set of all strings ending in aa over Σ ={a,b}

5) Define state ,transition with a suitable example

6) Identify the regular expression for set of all strings such that number of a’s divisible
by 3 over Σ = {0,1}

7) Define Theory of Computation and computation.

8) Explain how does a non-deterministic finite automaton (NFA) differ from a DFA?

9) Suggest True or False: An unrestricted grammar is the most powerful type of grammar
in Chomsky’s hierarchy?

10) Justify True or False : Chomsky’s hierarchy consists of four types of grammars?

11) State and prove Arden’s theorem using proper example.

12) Define Alphabet and String in Automata Theory. Explain the term Epsilon transition.

13) Explain the terminal and non-terminal symbols of a grammar.

14) What are Right Linear grammar and Left Linear grammars?

15) Explain the condition for Arden’s Theorem to be applicable?

16) State the reason or explain the reason for using Normal forms in grammar
17) Write down instantaneous description or configuration of a TM?

18) Define the language recognized by the TM

19)Give an example of a language accepted by PDA but not by DFA.

20) Name the main components of a Turing Machine.

21) State significance of the blank symbol in a Turing Machine?

22) What is the role of checking off symbols in a Turing Machine?

23 ) State Pumping lemma for Context free language.

24) Define a Turing Machine.
 25) Mention any two problems which can only be solved by TM.

26) State Pumping lemma and its advantages.

27) What are useless symbols in a grammar.

28) Explain acceptance of PDA with empty stack.

29)Define instantaneous description of a PDA.

30) Give the formal definition of a PDA.

31) Define the languages generated by a PDA using final state of the PDA and empty stack
of that PDA

32) Is it true that non – deterministic PDA is more powerful that deterministic PDA?Justify
Draw graphical representation for PDA
LONG ANSWER QUESTIONS

1.Construct a DFA equivalent to the NFA. M=({p,q,r},{0,1}, δ,p,{q,s}) Where δ is defined in

the following table

2. Let L be a set accepted by an NFA.Then prove that there exists a deterministic finite

automaton that accepts L.Is the converse true? Justify your answer.

3. Convert the following ε-NFA to DFA

4. Convert the given Moore machine into equivalent Mealy machine

5. Minimize the following DFA.

6.Obtain the regular expression that denotes the language accepted by the following DFA.

7.Construct a derivation tree for the string 0011000 using the grammar

S->A0S |0 | SS , A-> S1A | 10.

8. Let the production of the grammar be S-> 0B | 1A, A-> 0 | 0S | 1AA, B-> 1|1S | 0BB.for
the string 0110 find the right most derivation.

9. State pumping lemma and hence find whether the given language is regular or not L={a m b
n
|m>n}

10. Change the following grammar into CNF

S → abSb/a/aAb
A →bS/aAAb

11. Design CFG for Regular Expression r = ( a+ b)* bb ( a+ b)* which is free from ε
production.

12. Construct PDA for the language L(G) = { w | w ∈ (a,b) and w is of form anb2n,n≥ 1 }.Also
mention the state transitions of this PDA while parsing the string w=’aabbbb’.

13. Construct PDA for the language L(G) = { wwR|w∈ (0,1)+ }.Explain how does this PDA
work for the input ‘001100’.Also verify the nature of this PDA deterministic or
nondeterministic.

14. Construct Turing machine to accept the following language L(G) = { w | w ∈ (0,1) and w
is of the form 0n1n where n≥ 1 }.

15. Demonstrate working model of a Turing Machine to perform proper substraction.

16.Construct NFA for the regular expression (0+1)01

17.Show that the set L = {0i1i | i ≥ 1} is not regular.

18.Show that the regular language are closed under : Union , Intersection, Kleene closure.
19.Define PDA using conventional notations

18. Define PCP ? Explain with the help of an example.

20.Design a NFA accept the following strings over the alphabets {0,1} that begins with 01
and ends with Check for the validity of 01111 and 0110 strings.

21.Convert the following ε -NFA to NFA and then convert the resultant NFA to DFA.

22.Explain Myhill-Nerode Theorem using proper example

23.Explain Pumping Lemma for Regular Languages and its Application with examples

24.Explain CNF and GNF using proper examples

25.Construct a finite automata for the RE 10+(0+11)0*1

26.Construct the PDA accepting the language L={anbn/n>0} by empty stack and final state

27.Define Deterministic PDA.Is NPDA and DPDA equivalent? Illustrate with an example

28.Explain the universal Turing machine with its significance. Also explain the construction
of Universal Turing machine with example..

29.Explain class P, class NP, NP-complete and NP-hard problem with examples in detail.

30. Construct the Grammar with the productions E → E+E E→id Check whether the yield
id + id + id is having the parse tree with root E or not.

31. What are the different ways in which a PDA accepts the language? Define them. Is a true
that non deterministic PDA is more powerful than that of deterministic PDA? Justify your
answer.