Q. Is the following statement correct?
Statement: Thompson construction is used to convert Regular expression to finite automata.

View solution

Q. State true or false:
Statement: Regular expression can directly be converted to DFA without intermediate steps.

View solution

Q. NFA to DFA conversion is done via

View solution

Q. Which of the following cannot be converted in an ordinary NFA?

View solution

Q. The conversion of NFA to DFA can be done in:

View solution

Q. Conversion of regular expression to e-NFA takes ___________ time.

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

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

View solution

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

View solution

Q. Which of the following conversion is not feasible?

View solution

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

View solution

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

E^R=?

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

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