694 views
1 votes
1 votes
How to check whether the language is regular or not ? { wxw | w,x belongs to (a+b)raise to +}

2 Answers

1 votes
1 votes

It is regular.

Lets see the strings in L
= { a, b, aa, ab, ba, bb, aaa, ..... } (When w is ϵ, wxw generates all these strings and hence we don't need to consider any other case for w)
= Σ* - {ϵ}
As we have no restriction on the length of x, we can leave 1st and last symbol as it is and consider the rest part as x.

eg : w=bab x=bb

wxw = babbbbab; we may assume x = abbbba so we can read it as : bxb which is finite.

 

edited by

Related questions

0 votes
0 votes
1 answer
2
Deepak9000 asked Nov 27, 2023
201 views
Why is C is regular as it non regular as?Please help me with this confusion
0 votes
0 votes
1 answer
3
M_Umair_Khan42900 asked Dec 29, 2022
754 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...