adplus-dvertising
frame-decoration

Question

Let for ∑= {0,1} R= (∑∑∑) *, the language of R would be

a.

{w | w is a string of odd length}

b.

{w | w is a string of length multiple of 3}

c.

{w | w is a string of length 3}

d.

All of the mentioned

Answer: (b).{w | w is a string of length multiple of 3}

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Let for ∑= {0,1} R= (∑∑∑) *, the language of R would be

Similar Questions

Discover Related MCQs

Q. If ∑= {0,1}, then Ф* will result to:

Q. The given NFA represents which of the following NFA

Q. Which of the following represents a language which has no pair of consecutive 1’s if ∑= {0,1}?

Q. The finite automata accept the following languages:

Q. (a + b*c) most correctly represents:

Q. Which of the following regular expressions represents the set of strings which do not contain a substring ‘rt’ if ∑= {r, t}

Q. According to the precedence rules, x-y-z is equivalent to which of the following?

Q. Dot operator in regular expression resembles which of the following?

Q. Which among the following is not an associative operation?

Q. Which among the following is equivalent to the given regular expression?
01*+1

Q. The total number of states required to automate the given regular expression
(00)*(11)*

Q. Generate a regular expression for the following problem statement:
Password Validation: String should be 8-15 characters long. String must contain a number, an Uppercase letter and a Lower case letter.

Q. Generate a regular expression for the following problem statement:
P(x): String of length 6 or less for å={0,1}*

Q. The minimum number of states required in a DFA (along with a dumping state) to check whether the 3rd bit is 1 or not for |n|>=3

Q. Which of the regular expressions corresponds to the given problem statement:
P(x): Express the identifiers in C Programming language

l=letters

d=digits

Q. Generate a regular expression for the given language:l
L(x): {xÎ{0,1}*| x ends with 1 nd does not contain a substring 01}

Q. The minimum number of transitions to pass to reach the final state as per the following regular expression is:
{a,b}*{baaa}

Q. Which of the following is an utility of state elimination phenomenon?

Q. If we have more than one accepting states or an accepting state with an outdegree, which of the following actions will be taken?

Q. Which of the following is not a step in elimination of states procedure?