Register

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

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

if yes then why please explain
User Avatar

1 Answer

0 votes
0 votes
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 .
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
3 answers
2
Durgesh Singh asked Jul 25, 2017
5,555 views
Why L = { w x w ∣ w , x ∈ ( a + b ) + } is not regular?
We can say there are four types of strings in the language so the regex will be: a(a+b)+a + b(a+b)+b + a(a+b)+b + b(a+b)+a Please expleain where I am wrong
We can say there are four types of strings in the language so the regex will be: a(a+b)+a + b(a+b)+b + a(a+b)+b + b(a+b)+a Please expleain where I am wrong
User Avatar
Link Copied!