Professional Documents
Culture Documents
Week 1
Week 1
reviewer1@nptel.iitm.ac.in ▼
Unit 2 - Week - 1
Course
outline Assignment 1
.
How to Access
the Portal ?
Introduction to
Finite Automata For every finite language, there exists a DFA which accepts the language.
Basic Notation
and For some finite language, there does not exist a DFA which accepts the language.
Convention,
DFA
Only finite languages are accepted by DFAs.
Example of
DFAs Every infinite language is accepted by some DFA.
Computation by
DFA and
Regular
operation Accepted Answers:
For every finite language, there exists a DFA which accepts the language.
Introduction to
Nondeterminism
2) DFA has 1 point
Quiz :
Assignment 1
infinitely many state but finitely many accept states.
Assignment 1
Solution
finitely many states.
Week - 2
transition function with finite domain and range.
Week - 3
transition function with possibly infinite range or domain.
Week - 4
Week - 5
Accepted Answers:
Week - 6
finitely many states.
https://onlinecourses.nptel.ac.in/noc17_cs34/unit?unit=7&assessment=76 1/5
29/12/2017 Theory of computation - - Unit 2 - Week - 1
Which of the following language is accepted the given DFA?
∗ ∗
Σ − {x|x ∈ Σ and |x| > 0}
∗
Σ − {0, 1}
{0, 1}
Accepted Answers:
∗ ∗
Σ − {x|x ∈ Σ and |x| > 0}
A state in DFA whose removal will not change the language accepted by DFA.
A state in DFA from where cannot goto any other state.
A state in DFA from where we cannot goto any accept state.
A state in DFA reachable by every other state.
Accepted Answers:
A state in DFA from where we cannot goto any accept state.
Accepted Answers:
NFA computes on multiple paths simultaneously.
6) 2 points
https://onlinecourses.nptel.ac.in/noc17_cs34/unit?unit=7&assessment=76 2/5
29/12/2017 Theory of computation - - Unit 2 - Week - 1
Which of following languages are accepted by the given DFA?
All binary strings with odd difference between number of 0 and number of 1.
All binary strings with even difference between number of 0 and number of 1.
Accepted Answers:
All binary strings of odd length.
All binary strings with odd difference between number of 0 and number of 1.
{w ∣ w ends with 0}
Accepted Answers:
{w ∣ w does not end with 1}
8) Exactly one of four languages given below is not accepted by any DFA. Identify it. 2 points
2m 4m
L = {x ∣ x = 0 1 where m ∈ ℕ}
4m
L = {x ∣ x|x = 0 where m ≥ 0}
Accepted Answers:
https://onlinecourses.nptel.ac.in/noc17_cs34/unit?unit=7&assessment=76 3/5
29/12/2017 Theory of computation - - Unit 2 - Week - 1
2m 4m
L = {x ∣ x = 0 1 where m ∈ ℕ}
L = {x ∣ x is binary representation of multiple of 5 and contains even number of 1} ∪ {ϵ}
Accepted Answers:
L = {x ∣ x is binary representation of multiple of 5 and no prefix of x is of form 5m + 3} ∪ {ϵ}
⎯⎯⎯⎯
L1 ∪ L2
L1 ∩ L2
L1 ∪ L2
⎯⎯⎯⎯
L1 ∩ L2
Accepted Answers:
L1 ∩ L2
https://onlinecourses.nptel.ac.in/noc17_cs34/unit?unit=7&assessment=76 4/5
29/12/2017 Theory of computation - - Unit 2 - Week - 1
https://onlinecourses.nptel.ac.in/noc17_cs34/unit?unit=7&assessment=76 5/5