You are on page 1of 5

Assignment 1

The due date for submitting this assignment has passed.


Due on 2017-08-07, 23:59 IST.

Submitted assignment

1 point
Which of following is true?

For every finite language, there exists a DFA which accepts the
language.

For some finite language, there does not exist a DFA which accepts the
language.

Only finite languages are accepted by DFAs.

Every infinite language is accepted by some DFA.


1 point
DFA has

infinitely many state but finitely many accept states.

transition function with finite domain and range.

finitely many states.

transition function with possibly infinite range or domain.


1 point
Which of the following language is accepted the given DFA?

{0,1}

Σ∗−{0,1}

Σ∗−{x|x∈Σ∗ and |x|>0}

ϕ
1 point
What is a dump state?
A state in DFA whose removal will not change the language accepted by DFA.
A state in DFA from where we cannot goto any accept state.
A state in DFA from where cannot goto any other state.
A state in DFA reachable by every other state.
2 points
Which of following are true?

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

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

All binary strings of odd length.


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

{w∣w contains 1 and ends with a 0}


{w∣w ends with 0}

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

{w∣w does not end with 1}


2 points
Exactly one of four languages given below is not accepted by any DFA. Identify it.

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

L={x∣x=02m14m where m∈N}

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

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


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

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

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

L={x∣x is binary representation of multiple of 5 and 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}∪{ϵ}
5 points
L1={x∣x is binary representation of multiple of 3}∪{ϵ}.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

You might also like