@VTUPadhai- TOC (BCS503) Imp Qns
TOC PLAYLIST LINK –
https://www.youtube.com/playlist?list=PLxhmqm0jYqJ9Xefiwfovm9Gbj26CPklCG
Module 1:
1) Define the following terms with examples: Alphabet, Power of an alphabet, String,
Concatenation, Languages, Symbol.
2) Difference between DFA, NFA, and ε-NFA with an example.
3) Briefly describe the applications of Theory of Computation.
4) Define DFSM. Design a DFSM to accept each of the following languages:
i) L= {w ε {0,1}* : w has 001 as a substring}
ii) L={ w ε{0,1}* : w has even number of a’s and even number of b’s}
iii) To accept binary numbers divisible by 5.
iv) L= {w ε {0,1}* : w does not end in 01}
v) L= { w ε{a,b}* : every a in w is immediately preceded and followed by b}
vi)L= {w ε{a,b}* : w does not contain substring aab}
vii) String of a’s and b’s ending with abb.
viii)L={w/|w| mod S=0 } on ∑={a}.
ix) L= { w ε{a,b}* : w has all strings that ends with sub string abb}
x) L ={w; where |w| mod 3=0 where ∑ = {a} }
xi) L = {w ε{a,b}* : every a region in w is of even length }
xii) To accept strings over {a,b} such that each block of 5 (length five) consecutive symbols have atleast
two a’s.
xiii) To accept L= {w (ab+ba) | w ε{a,b}* }
xiv) To accept L= {wbab | w ε{a,b}* }
5)
@VTUPadhai- TOC (BCS503) Imp Qns
Module 2:
1) Define Regular Expressions.
2) Obtain RE to accept strings of a’s and b’s whose second symbol from
the right end is a
3) Obtain RE to accept words with two or more letters but beginning and
ending with the same letter where {a, b} are inputs.
4) Obtain NFA which accepts strings of a’s and b’s starting with the
string ab
5) Obtain NFA for the Regular Expression (a+b)*aa(a+b)*
6) State and prove Pumping Lemma theorem. (6M)
7) Prove that for every RE, there is an equivalent finite automaton. (6M)
8) Show that , L= {WWR | W Є {a,b) *}} is not regular
9) Show that regular languages are closed under
i. Union,concatenation and Kleens star ii. Intersection and Difference
10) Table filling algorithm qns (refer toc playlist…same qns would be asked for 10 marks)
11) Subset construction for a given RE( refer toc playlist and notes….same qns would be asked
for 10marks)
Module 3:
@VTUPadhai- TOC (BCS503) Imp Qns
1. Define Context free grammar. Constructing CFG for given condition (Refer yt playlist)
i) L={02n1m | n>=0,m>=0}
ii) L= {WWR | W Є {a,b) *}}
iii) L= { w | w Є {0,1 }* with atleast one occurance of “101” }
iv) L= { strings of a’s and b’s with equal number of a’s and b’s }
V) Obtain a grammar to generate a language of strings 0’s and 1’s haing a substring 000
2. Define the leftmost derivation, rightmost derivation and parse tree. (06M)
3. What is ambiguous grammar? Prove that the given grammar is ambiguous.
4.Conversion of ambiguous to unambiguous.
Usually 5 standard qns related to PDA are asked in exam…and there are 2 methods to solve
them….checkout the toc playlist where I hav discussed in detail.
Module 4:
1. The Pumping Lemma for Context-Free Languages and Closure Properties of Context-Free
Languages. ( Show that CFL is not closed under union , Concatenation , star and
complementation )
2. Pumping lemma based qns . For eg-
3. Normal Forms for Context-Free Grammars
@VTUPadhai- TOC (BCS503) Imp Qns
i)Simplification of grammars (removal of useless symbols, epsilon, unit productions-refer
notes )
ii) Conversion of CFG TO CNF
Module 5:
1. Turing Machine definition, Representation,Turing machine model and components
2. Techniques for turing machine construction.
3. Define Turing Machine (TM). Design a TM for language L={0n 1n | n>=0} Show that the string
0011 is accepted
4. Define Turing Machine (TM). Design a TM for language L={1n 2n 3n| n>=1} L4 12 Show that
the string 111222333 is accepted
5. Demonstrate the model of Linear bound automata(LBA) with neat diagram
@VTUPadhai- TOC (BCS503) Imp Qns
6. Applications of Turing machines
7. Short note on
i) Undecidability: A Language That Is Not Recursively Enumerable
ii) Recursive and Recursively Enumerable Languages
8. Explain The Church-Turing machine with neat a diagram
9. Explain Multiple TM with a neat diagram
