TOC_Q1

Mapping Function of a DFA

• Σ * Q -> Σ

• Q * Q -> Σ

• Σ * Σ -> Q

• Q * Σ -> Q

NFA, in its name has ’non-deterministic’ because of :

• The result is undetermined

• The choice of path is non-deterministic

• The state to be transited next is non-deterministic

• All of the mentioned

• x is a string such that it ends with ‘101’

• x is a string such that it ends with ‘01’

• x is a string such that it has odd 1’s and even 0’s

• x is a strings such that it has starting and ending character as 1

Can a DFA simulate NFA

• yes

• No

• sometimes

• depends on NFA

• {w | w ends with 010}

• {w | w starts with 010}

• {w | w contains 010 as a substring}

• {w | w does not contain 010 as a substring}

• 
• 

Convert the Epsilon NFA to NFA without null transitions

• 
• 
• 
• 

Let L1={w∣w has atleast four a's}and L2={w∣w has atmost two a's}.Which of the following is the language L1∩L2L1∩L2?

• {w∣w has exactly three a's}

• ∅∅

• {w∣w has exactly two, three or four a's}

• {w∣w does not have exactly three a's}