in Theory of Computation edited by
203 views
0 votes
0 votes
Which of the following is/are Regular?

A] $\left \{ XWYW^{R} \space\ | \space\ W,X,Y \in \left \{ a,b \right \}^{+} \right \}$

B] $\left \{ WXW^{R}Y \space\ | \space\ W,X,Y \in \left \{ a,b \right \}^{+} \right \}$

C] $\left \{ WXYW^{R} \space\ | \space\ W,X,Y \in \left \{ a,b \right \}^{+} \right \}$

D] None

 R => Reverse

Please describe your answer.
in Theory of Computation edited by
203 views

4 Comments

@Kabir5454 Google should help :)

1
1

@Kabir5454

Could you please confirm any answer?
I have also replied the supporting expressions for my answer(all are regular).

0
0
Seems correct to me bro.
0
0

2 Answers

0 votes
0 votes
C is the regular

we don’t know about XY, but it belongs to Σ. So we can consider whatever as XY,

let's take a string abbababbaba. We can consider bbababbab as XYZ and string w = “a”  and w reverse also “a”

so we can take this grammar as regular a(a+b)*a or b(a+b)*b

1 comment

What about options A and B?
0
0
0 votes
0 votes
i think we can try this problem by applying pumping lemma . So that we can check the above options easily
by

1 comment

Pumping lemma for checking irregularity of a language. If a language satisfies pumping lemma then it may or may not be regular.

you are getting confused.
0
0

Related questions