473 views
3 votes
3 votes
L={WX$W^{R}$ / W,X$\epsilon (a+b)^{*}$.}

L={XW$W^{R}$ / W,X$\epsilon (a+b)^{*}$.}

l={W$W^{R}$X /W,X $\epsilon (a+b)^{*}$.}

which of the above are REGULAR LANGUAGES.?

------------------------------------------------------------------------------------------------------------------------

I think all are regular

I)w=$\epsilon$ then w^r=$\epsilon$ and x=$(a+b)^{*}$  // it accept complete language so it is regular.

same as for remaining problems also.am i ryt???

1 Answer

Best answer
4 votes
4 votes

                 all are regular 

  • reg exp: a(a+b)*a + b(a+b)*b
  • reg exp:(a+b)*
  • reg exp:(a+b)*
selected by

Related questions

0 votes
0 votes
1 answer
3
practicalmetal asked Mar 25, 2023
374 views
The solution to $X = r +Xs$ by Arden’s Lemma when s has ϵa) an infinite number of solutionsb) a finite number of solutionsc) is always uniqued) none
0 votes
0 votes
3 answers
4
HenryAsks21 asked Mar 4, 2022
1,420 views
For the following question if True show why, and if it’s False show why.)Question: For any language A1, A2, if $A1 \cup A2$ is regular, then A1 and A2 are regular langu...