# Regular language – Theory Of Computing

Regular language – Theory Of Computing

#### Show Answer With Best Explanation

Answer â€“ E
Explanation:
Since, Regular Language doesnâ€™t have memory .So, it doesnâ€™t have capacity to hold anything.

In L1, in order to calculate aÅºZ we have to first calculate zz Â & store the value in memory then need to calculate power of a. but we already known that Regular Language doesnâ€™t have capacity to hold anything. So, L1 is not regular language.

In L2, again we have to calculate zÅº , then store it & then need to find power of a. So, L2 is also not regular language.

In L3, we have to compare first Ï‰ with second Ï‰. But, Regular Language doesnâ€™t have capacity to compare two string. So L3 is also not regular language.

#### Show Answer With Best Explanation

Answer : C
Explanation:
L1 = (a* + b)*
= {â‚¬, a, b, aa, ab, ba, bbâ€¦..} (generate all string possible over alphabet a,b)
L2 = (a + b)*
= {â‚¬, a, b, aa, ab, ba, bbâ€¦..} (generate all string possible over alphabet a,b)
L1 ==L2
(a+ b)* = (a+b) = (a+b) = (a+b)* = (ab)* = a(ba)* = b(ab)*

error: Content is protected !!
Hi,how Can We Help You ?