J S S Mahavidyapeetha
J S S Academy of Technical Education, Bangaluru-60
Department of Information Science & Engineering
Course Assignment/ Question bank
Faculty In charge: Mamatha G Unit no.: Module-1
Subject With Code: Theory of Computation [BCS503] Assignment no.: 1
Announcement Date: 03 / 10 /2024 Submission Date: / /2024
Relevance of CO/PO/PSO:
Course Outcome (CO) Program Outcomes (PO) Program Specific
Outcomes (PSO)
C303.1: Make use of the conceptual facts of PO1,PO2,PO3,PO5, PO8, PSO2,PSO3
Automata theory to construct different types of PO9,PO10,PO12
Finite Automata and perform inter-conversion
among them.
Q No. Questions Mark
s
FA concepts
1. Give the applications of Theory of computation. 5
2. Define the following terms with examples : 2x4
i)Alphabets (ii) functions and relations on Strings
(iii) techniques for defining Language (iv) power set of ∑ , L*
3. What is Decision problem? Explain with examples 5
DFA
4. Define DFSM. Design a DFSM to accept string of binary digits which are divisible by 5. 2+4
5. Obtain a DFA to accept strings of a’s and b’s ending with the string ab or ba. 4
6. Give DFA’s accepting the following strings over the alphabet {0,1} 2x3
(a) The set of all strings containing 1101 as a substring.
(b) The set of all strings that begin with 01 and end with 11.
7. Obtain a DFA to accept strings of a’s and b’s 2x3
a) except those containing the Substring aab.
b) except those ending with Substring bab.
8. Obtain DFA to accept strings, 2x3
a) Starting with at least two 0’s and ending with at least two 1’s.
b) beginning with a 0 followed by odd number of 1’s and ending with a 2
9. Design a DFA to accept the Language : 3+3
L= {w: w has odd number of 1’s and followed by even number of 0’s}.
Consider the DFA with the following transition table. Describe the language accepted by 5
this DFA.
11. Obtain a DFA to accept strings of a’s and b’s having even number of a’s and b’s. 5
12. Design DFA accepting the following languages over alphabet {a,b} 5+5
(a) L= {w:|w| mod 5 < > 0},
(b) The set of all strings not containing ‘abab’
Q No. Questions Mark
s
NFA
1. Prove DFA D constructed from NFA N by “Subset construction method” has L(D)=L(N) 5
2. design NFA to accept strings of a’s and b’s 6
Ending with ab or ba and also write its equivalent DFA.
‘a’ at the second last position
3. Convert the following NFA’s to a DFA by Subset construction method 3+3
I] N=({p,q,r,s},{0,1},δ,{p},{r,s}), Where δ is: δ(p,0)={p,r}, δ(p,1)={q}, δ(q,0)={r,s},
δ(q,1)={p}, δ(r,0)={p,s}, δ(r,1)={r}, δ(s,0)={q,r}, δ(s,1)=Φ
II]
4. Construct a NFA for the language 5
(i) L1={consisting a substring 0101} (ii) L2={a U b }
n n
Q No. Questions Marks
Epsilon NFA є-NFA.
1. 6
Compare and contrast DFA, NFA, є-NFA.
2. 4
Define the following: Non- determinism, є-closure
3. 5
Design є-NFA for accepting Decimal number with
Optional sign, decimal dot, string of digits.
4. Construct a є - NFA to accept strings of the form a*b*c*. apply the ∈ - transition 6
elimination procedure and transform it to DFA
5. 3+4
Explain subset construction method to convert є-NFA to DFA with an example
3+4
Give the procedure for the elimination of є -transition. Convert the following є - NFA to
DFA.
є a b
→p r q { p, r }
q ᶲ p ᶲ
r* {p, q} r p
minimization of DFA
7. Define the following: 4
equivalent states, distinguishable states
8. Explain the Table- filling algorithm with an example 2+6
9. Give the algorithm for the minimization of DFA, construct the minimum state DFA for the 3+6
following DFA.
0 1
→q1 q2 q3
q2 q3 q5
*q3 q4 q3
q4 q3 q5
*q5 q2 q5
Signature of the Reviewers Signature of the Faculty
