CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Let S and T b...

Question

Let S and T be language over $\sum = {a, b$ } represented by the regular expressions $(a + b^{})^{}$ and $(a + b)^{*} .$ respectively. which of the following is true?

Open in App

Solution

According to rules of regular expressions

$(r_{1} + r_{2})^{} \equiv (r_{1} + r_{2}^{})^{}$

Therefore $(a + b^{})^{} \equiv (a + b)^{}$

So S = T

Suggest Corrections

thumbs-up

0

Similar questions

Q. Let P be a regular language and Q be a context-free language such that

Q \subseteq P

. (For example, let P be the language represented by the regular expression

P^{*} q^{*}

{p^{n} q^{n} ∣ n ϵ N}

Then which of the following is ALWAYS regular ?

Q. Consider the regular expression :

R = (a + b)^{*} (a a + b b) (a + b)^{*}

Which deterministic finite automaton accepts the language represented by the regular expression R?

Q. The length of the shortest string NOT in the language

(o v e r \sum = {a, b})

of the following regular expression is

a^{*} b^{*} (b a)^{*} a^{*}

x, y

z

be regular expressions. Let

α, β, Γ

be regular expressions defined as follows.

α = (x * y) * x * y β = x * y (x * y) * Γ = x * (y x *) * y

(α)

(β)

(Γ)

be language generated by regular expressions

α, β, Γ

respectively. Which of the following is true?

Q. Consider the following Turing Machine T over the alphabet {a,b} and tape alphabet {a, b, t}. Here 't' represent tape alphabate.

The language accepted by the above Turing Machine T will be

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Characteristics of Particles of Matter

Watch in App

Join BYJU'S Learning Program

CrossIcon