Question: Given any regular language $L$. How you will determine if $L=L^{*}$ ? For each of the following languages, say whether it is regular or not

 Given any regular language $L$. How you will determine if $L=L^{*}$

Given any regular language $L$. How you will determine if $L=L^{*}$ ? For each of the following languages, say whether it is regular or not and give a proof. 1. $L=\left\{a^{n} b^{n} a^{n} \mid n \geq O ight\}$ 2. $L=\left\{a^{n} b^{n+1} \mid n \geq 0, 1 \geq 1 ight\}$ CS.VS. 1093|

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!