Q. State true or false:
Statement: Pumping lemma gives a necessary but not sufficient condition for a language to be regular.

View solution

Q. Which of the following is/are an example of pigeon hole principle?

View solution

Q. Pigeonhole principle can be applied in the following computer science algorithms:

View solution

Q. If n objects are distributed over m places, and n < m, then some of the places receive:

View solution

Q. Which of the following fields may have pigeonhole principle violated?

View solution

Q. Which of the following is not an application of Pumping Lemma?

View solution

Q. Which of the following can refer a language to be non regular?

View solution

Q. Which of the following is not an example of counting argument?

View solution

Q. If L1, L2 are regular and op(L1, L2) is also regular, then L1 and L2 are said to be ____________ under an operation op.

View solution

Q. Suppose a regular language L is closed under the operation halving, then the result would be:

View solution

Q. If L1′ and L2′ are regular languages, then L1.L2 will be

View solution

Q. If L1 and L2′ are regular languages, L1 ∩ (L2′ U L1′)’ will be

View solution

Q. If A and B are regular languages, !(A’ U B’) is:

View solution

Q. Which among the following are the boolean operations that under which regular languages are closed?

View solution

Q. Suppose a language L1 has 2 states and L2 has 2 states. After using the cross product construction method, we have a machine M that accepts L1 ∩ L2. The total number of states in M:

View solution

Q. If L is a regular language, then (L’)’ U L will be :

View solution

Q. If L is a regular language, then (((L’)r)’)* is:

View solution

Q. Which among the following is the closure property of a regular language?

View solution

Q. If L is a language, the reversal of the language can be represented as:

View solution

Q. If L is a regular language, ____ is also regular.

View solution