Question

identify language is regular or not   L={wcw^r | w,c belongs to E*} E={a,b}

if yes then why please explain

Comments

3.7.7: https://gatecse.in/identify-the-class-of-a-given-language/

you can search over internet too.

Answer 1

Yes , it is a regular language

Because for w = epsion ( empty string ) »

      L = { c | c belongs to  (0+1)*}

   i.e , all string over (0+1)* : for which we ofcourse built  a DFA .