Module 1 : Basic Concepts and Finite Automata
1) Write note on Chomsky Hierarchy
2) State applications of Finite Automata in brief
3) What is Finite Automata?
4) Define the term: Unrestricted grammer
5) Write short note on Mealy machine
6) Distinguish between NFA and DFA
7) Give deterministic finite automata accepting the following languages over the
alphabet{0,1}
a) Number of 1's is even and number of 0's is even
b) Number of 1's is odd and number of 0's is odd
8) Give the finite automation M accepting (a,b)*(baaa)
9) Design a DFA to accept strings over the alphabet set {a,b} that begin with 'aa' but
not end with 'aa'
10) Design a DFA which can accept a binary number divisible by 3
Or
Design of a divisibility - by - 3 - tester for a binary number
11) Design a DFA that accepts the following language
i) Set of all strings with odd number of 1's followed by even number of 0's Σ ={0,1}
ii) Set of all strings which begin and end with different letters Σ ={x,y,z}
iii) Strings ending with 110 or 111
12) Design a mealy machine for a binary input sequence such that if the sequence
ends with 100 the output is 1 otherwise output is 0
Module 2 : Regular Expressions and Languages
1) Determination of regular expression
2) Prove that
(1+00*1) + (1+00*1) (0+10*1)*(0+10*1)=0*1(0+10*1)*
3) Write RE for the following languages
i) The set of all string over{0,1} without length two
ii) L={a^nb^m l (n+m) is even}
iii) L={ω ∊ (a,b)* l (number of a's in ω ) mod 3=0}
iv) L ={a^nb^m l n >=4, m<=3}
4) Construct NFA from following RE and convert into minimized DFA.
i) (0+1)*(00+11) ii) (01*1) iii) (a+b)*aba
5) Design a DFA corresponding to the regular expression (a+b)*aba(a+b)*
6) Let Σ ={0,1}, construct NFA and hence regular expression for each of the following
a) L1 = { ω ∊ Σ* l ω has at least one pair of consecutive 0's)
b) L2 = { ω ∊ Σ* l ω has no pair of consecutive zero}
c) L3 = { ω ∊ Σ* l ω is a string with either 1 preceding a 0 or 0 preceding 1}
d) L4 = { ω ∊ Σ* l ω consists of an even number of 0's followed by odd number of 1's}
7) State Arden's theorem and use it to construct a regular expression corresponding to
the following automata
8) Definition of Pumping Lemma and its proof
9) Show that the language L={a^nb^n} is not regular
10) Using pumping lemma for regular sets, prove that the language, L={0^n l n is prime}
is not regular
11) Myhill - Nerode Theorem
12) Applications of RE
13) Let G = (V,T,P,S) be the CFG having following set of productions. Derive the string
''aabbaa'' using leftmost derivation and rightmost derivation
S-> aAS l a, A -> SbA l SS l ba
Module 4 : Pushdown Automata (PDA)
1) Construct a PDA accepting {a^nb^ma^n l m, n ≥ 1} by null store
2) Design a PDA for accepting a language
L ={WcW^T l W ∊ {a,b}*}
3) Design a PDA for detection of even palindrome over {a,b}
4) Construct a PDA equivalent to the following CFG
S -> 0BB
B -> 0S l 1S l 0
Test if 010^4 is in the language
5) Define DPDA
Module 5 : Turing Machine (TM)
1) Design a TM which accepts all strings of the form a^nb^n for n ≥ 1 and rejects all other
strings
2) Construct a TM for checking well formedness of parenthesis
3) Design a TM which recognizes words of the form a^nb^nc^n l n ≥ 1
4) Design a TM which recognizes palindromes over alphabet {a,b}
5) Multi-Tape Turing Machine
6) Explain the power of turing machine over finitie state machine
Module 6 : Undecidability
1) Halting problem of a Turing Machine
2) Does PCP with following two list:
A=(10,011,101) and B =(101,11,011) have a solution ? Justify your answer
3) Prove that there exists no algorithm for deciding whether a given CFG is ambiguous
4) Rice's Theorem
5) Grelbach Theorem
