QUESTION BANK 4

MODULE 1
1a. Explain with example (i)Language (ii) Power of an alphabet (iii) String
(iv)Concatenation (v) Suffix
b Define DFA and Construct DFA for the following Expression 5+5
. i) L = {W Є {0, 1}* : W has 001 as a substring}
ii) L = {W Є {a, b} * : W has even number of a’s and even number of b’s}.
2a. With a neat diagram, explain a hierarchy of language classes in automata theory.
b. Convert Following NFA to DFA
5+5

3a. Minimize the following DFSM,

6+4

b. Differentiate between mealy and Moore Machine with example.

MODULE 2
4a. Write regular expressions for the following
i) {w € {a,b}* with atmost one a}
ii) {w € {a,b}* doesnot end with ba}
4+6
iii) {w € {0,1}* has substring 001}
iv) {w € {0,1}* |w| is Even}

b. Explain the closure properties of Regular Languages

5a. Prove pumping lemma theorem for regular languages L={an bn : n>=0} not
regular. 5+5

b. Write equivalent Regular Expression for the given FSM

6a. Convert following RE’s into FSM’s
8+2
a. (ab*)*
b. (a U b)*
c. a*U b*
d. (aUb)ab

b. What is Regular grammar?

MODULE 3
7a. Define CFG. Construct CFG for the following Language
i)Balanced Parentheses 5+5
b. Consider the grammar:
S → aS |aSbS | ε
Is the above grammar ambiguous? Show that the string “aab” has two
i) Parse trees
ii) Left most derivations
iii) Right most derivations

8. Define PDA. Obtain PDA to accept the following Language

{na(w)=nb(w) where n>=1}.Draw the Transition Diagram for PDA. Also show the 10
moves made by the PDA for the string “aabbab”
9. Obtain the following Grammar in CNF
SABC 10
AaC | D
BbB |€ |A
CAc | € |Cc
Daa

MODULE 4
10a. Define Turing Machine? Explain the working of a Turing Machine? 5+5
b. Explain Multitape Turing Machine with diagram
11 Design Turing Machine to Accept the Language L={anbn | n>=1}.Obtain the 10
Transition table and Transition Diagram. Show the ID’s for the string aaabbb.
12a. Explain the Model of Linear Bounded Automata? 5+5

b. Explain the Techniques of Turing Machine?

 MODULE 5
13. Explain the following with examples
i)Decidable Language 10
ii)Undecidable Language
14 Define Non-Deterministic Turing Machine? Prove that there is a Deterministic
Turing Machine ‘M’ such that T(M)=T(M1) 10
15 Write short notes on
i) Quantum Computer 10
ii) Church Turing Thesis