29/12/2017 Theory of computation - - Unit 2 - Week - 1

reviewer1@nptel.iitm.ac.in ▼

Courses » Theory of computation Announcements Course Forum Progress Mentor

Unit 2 - Week - 1

Course
outline Assignment 1
.
How to Access
the Portal ?

Week - 1 1) Which of following is true? 1 point

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.

transition function with finite domain and range.

Week - 7
3) 1 point
Week - 8

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}

4) What is a dump state? 1 point

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.

5) Which of following are true? 2 points

NFA may have ϵ transitions but DFA does not.

NFA and DFA both may have ϵ transitions.

NFA computes on multiple paths but not simultaneously.

NFA computes on multiple paths simultaneously.

Accepted Answers:
NFA computes on multiple paths simultaneously.

NFA may have ϵ transitions but DFA does not.

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 of even length.

All binary strings with odd difference between number of 0 and number of 1.

All binary strings of odd length.

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.

7) Which of following languages are accepted by the given DFA? 2 points

{w ∣ w ends with 0}

{w ∣ w contains equal number of 0 and 1}

{w ∣ w does not end with 1}

{w ∣ w contains 1 and ends with a 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 ∈ ℕ}

L = {x ∣ x is name of some city in india }

4m
L = {x ∣ x|x = 0  where m ≥ 0}

L = {x ∣ x is binary representation of numbers of form 5m + 2 and 5m + 3}

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 ∈ ℕ}

9) Which of the following languages are accepted by given DFA? 5 points

L = {x ∣ x is binary representation of multiple of 5 and contains even number of 1} ∪ {ϵ}

L = {x ∣ x contains even number of 1} ∪ {ϵ}

L = {x ∣ x is binary representation of multiple of 5 and no prefix of x is of form 5m + 3} ∪ {ϵ}

L = {x ∣ x is binary representation of multiple of 5} ∪ {ϵ}

Accepted Answers:
L = {x ∣ x is binary representation of multiple of 5 and no prefix of x is of form 5m + 3} ∪ {ϵ}

10)L1 = {x ∣ x is binary representation of multiple of 3} ∪ {ϵ}. 5 points

L2 = {x ∣  no prefix of x is of form 3m + 2}.

Which of the following languages are accepted by given DFA?

⎯⎯⎯⎯
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