adplus-dvertising
frame-decoration

Question

Regular expressions are closed under

a.

Union

b.

Intersection

c.

Kleene star

d.

All of the mentioned

Answer: (d).All of the mentioned

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Regular expressions are closed under

Similar Questions

Discover Related MCQs

Q. Regular expression (x/y)(x/y) denotes the set

Q. Which of the following is same as the given DFA?

Q. Which of the given regular expressions correspond to the automata shown?

Q. Can the given state diagram be reduced?

Q. L is a regular Language if and only If the set of __________ classes of L is finite.

Q. A language can be generated from simple primitive language in a simple way if and only if

Q. Which of the following does not represents the given language?
Language: {0,01}

Q. According to the given language, which among the following expressions does it corresponds to?
Language L={xϵ{0,1}|x is of length 4 or less}

Q. Which among the following looks similar to the given expression?
((0+1). (0+1)) *

Q. Concatenation Operation refers to which of the following set operations:

Q. Concatenation of R with Ф outputs:

Q. RR* can be expressed in which of the forms:

Q. A finite automaton accepts which type of language:

Q. Which among the following are incorrect regular identities?

Q. Simplify the following regular expression:
ε+1*(011) *(1*(011) *) *

Q. P, O, R be regular expression over ∑, P is not ε, then
R=Q + RP has a unique solution:

Q. Arden’s theorem is true for:

Q. The difference between number of states with regular expression (a + b) and (a + b) * is:

Q. In order to represent a regular expression, the first step to create the transition diagram is:

Q. (0+ε) (1+ε) represents