edited by
552 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.
edited by

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
0 votes
0 votes
i think we can try this problem by applying pumping lemma . So that we can check the above options easily

Related questions

1 votes
1 votes
1 answer
1
Na462 asked Sep 11, 2018
1,543 views
Is Language L = {0(n+m) 1(k+l) | m = l, and m,n,k,l ≥ 1 } a regular language ? explain
0 votes
0 votes
0 answers
2
anupamsworld asked Sep 1, 2022
262 views
Construct PDA using empty stack method for the given language.$L=\left \{ x \space\ | \space\ x\in \left \{ a,b \right \}^{*} ; n_{a}(x) >= n_{b}(x) \right \}$//number of...
1 votes
1 votes
0 answers
3
3 votes
3 votes
0 answers
4
Arnab Bhadra asked Nov 22, 2017
659 views
L = {w | no of 0's in w != no of 1's in w and w Ɛ(0+1)*}What is the Language L?a. Regularb. CFLC. CSL