• retagged by
1,527 views

1 Answer

Best answer
2 2 votes

1. L={w(wR)* | w belongs (a+b)* }. Is regular?   = w = (a+b)*  [because (wR)* is considered null because of * ] (a+b)* contain all          strings included in L.

2. L= (wwR)*  it is not regular it is CFL .

3. (w)*wR  is also regular , since regular is closed under reversal . [(a+b)*]R

• selected by
Position:
Show:

Related questions

0 0 votes
0 0 answers
258
258 views
Monti Tekankar asked Aug 19, 2025
258 views
i am unable to recognize the which language is regular or which is not regular
1 1 vote
1 1 answer
2.5k
2.5k views
sachin_27 asked Jun 1, 2022
2,494 views
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b}if yes then why please explain
0 0 votes
2 2 answers
1.5k
1.5k views
rohan.1737 asked Aug 17, 2018
1,477 views
Is there any way to check whether a language is regular or not without using Pumping lemma?
2 2 votes
2 2 answers
1.6k
1.6k views
himgta asked Jul 13, 2018
1,616 views
L = {anbk : | n – k | = 2}L is regular or not? Please provide explanation.