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

Q. If E=F+G;
E^r=?

View solution

Q. If E= FG, E^r=?

View solution

Q. Simplify the following identity:
E=01*+10*

E^R=?

View solution

Q. Which of the following obey the closure properties of Regular language?

View solution

Q. Which of the following conversion is not feasible?

View solution

Q. The computation of e-closure of n-states takes ______ time.

View solution

Q. For a _________ state DFA, the time taken for DFA-NFA conversion is O(n).

View solution

Q. With reference to Automaton to Regular Expression Conversion, for each of the n rounds, where n is the number of states of DFA, we can _________ the size of the regular expression constructed.

View solution