SIR M.
VISVESVARAYA INSTITUTE OF TECHNOLOGY
Department of Computer Science and Engineering
Accredited by NAAC | Approved by AICTE New Delhi | Affiliated to VTU, Belagavi,
Krishnadevaraya Nagar, Bengaluru-562157
COURSE/CODE: THEORY OF COMPUTATION/ BCS503
CLASS/SECTION: V sem
Tutorial-1
1. Give the DFA accepting the language over the alphabet 0,1 that have the set of all strings
beginning with 101.
a. Determine DFA diagram to accept strings of 0’s and 1’s starting with at least two 0’s and
ending with at least two 1’s
2. (ii)Model DFA over alphabet ={0,1} that contains set of strings of 0’s and 1’s except those
containing substring 001
3. Solve the following conversion Epsilon NFA to DFA
a.
4. Examine the following terms with examples: Alphabet, Power of an alphabet, String,
Concatenation, Symbol and Languages.
5. Illustrate a DFA to accept each of the following languages:
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}
iii. L={ wϵ{0,1}* : w has binary number divisible by k where k is 4
6. Modify a diagram to DFA from the given NFA
7. i)Determine diagram for NFA that accepts the set of all strings over { 0,1} that starts with 0 or 1
and ends with 01 or 10
ii) Construct NFA to accept all the strings over the alphabet {0,1} ending with 010
8. i) Determine DFA diagram to accept strings of 0’s and 1’s starting with at least two 0’s and ending
with at least two 1’s
ii)Model DFA over alphabet ={0,1} that contains set of strings of 0’s and 1’s except those
containing substring 001
9. Give the DFA accepting the language over the alphabet 0,1 that have the set of all strings such that
the no of zero’s is divisible by 5 and the no of 1’s is divisible by 3.
10. b) Construct a DFA equivalent to the NFA. M=({p,q,r},{0,1}, δ,p,{q,s}) Where δis defined in
the following table.
11. Construct a DFA equivalent to the NFA given below
12. Construct a NFA accepting all string in {a,b}+ with either two consecutive a’s or two consecutive
b’s.
13. Give the DFA accepting the following language:
set of all strings beginning with a 1 that when interpreted as a binary integer is a multiple of 5.
14. Construct DFA equivalent to the NFA given below
15. Consider the following ε-NFA.Compute the ε-closure of each state and find it’s equivalent DFA
