Question 1 |

Consider the following two statements about regular languages:

S1: Every infinite regular language contains an undecidable language as a subset.

S2: Every finite language is regular.

Which one of the following choices is correct?

S1: Every infinite regular language contains an undecidable language as a subset.

S2: Every finite language is regular.

Which one of the following choices is correct?

Only S1 is true | |

Only S2 is true | |

Both S1 and S2 are true | |

Neither S1 nor S2 is true |

Question 1 Explanation:

Question 2 |

Let L \subseteq \{0,1\}^* be an arbitrary regular language accepted by a minimal DFA with k states. Which one of the following languages must necessarily be accepted by a minimal DFA with k states?

L - \{01\} | |

L \cup \{01\} | |

\{0,1\}^* -L | |

L \cdot L |

Question 2 Explanation:

Question 3 |

Which of the following is true?

Every subset of a regular set is regular | |

Every finite subset of non-regular set is regular | |

The union of two non regular set is not regular | |

Infinite union of finite set is regular |

Question 3 Explanation:

Question 4 |

Consider the following statements.

I. If L_1\cup L_2 is regular, then both L_1 \; and \; L_2 must be regular.

II. The class of regular languages is closed under infinite union.

Which of the above statements is/are TRUE?

I. If L_1\cup L_2 is regular, then both L_1 \; and \; L_2 must be regular.

II. The class of regular languages is closed under infinite union.

Which of the above statements is/are TRUE?

I only | |

II only | |

Both I and II | |

Neither I nor II |

Question 4 Explanation:

Question 5 |

For \Sigma =\{a,b\}, let us consider the regular language

L=\{x|x=a^{2+3k} \; or \; x=b^{10+12k}, k\geq 0\}.

Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for L?

L=\{x|x=a^{2+3k} \; or \; x=b^{10+12k}, k\geq 0\}.

Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for L?

3 | |

5 | |

9 | |

24 |

Question 5 Explanation:

There are 5 questions to complete.

Remove the words “is prime” from the question number 8, option a, I think it’s get written by mistake.

Thank you for your suggestions. We have updated the correction suggested by You.

Edit on question number 17.

It is “Which of the following statement is Correct.” ?

Thank you for your suggestions. We have updated the correction suggested by You.

For Question 2, please add a comma in Option c -> {0,1}* – L

Q11 has same option in A and B

Option B updated.