379 views
1 votes
1 votes
L={ W(W^r) , W ∈ (a,b)* }

W^r is reverse of W.

Is it a regular language ?

please Explain.

1 Answer

Best answer
2 votes
2 votes

wwR is CFL.

  • NPDA can simulate it.
  • It cannot be simulated by DPDA. 
  • It is not regular.

NB : wxwR is regular

selected by

Related questions

0 votes
0 votes
2 answers
1
rohan.1737 asked Aug 17, 2018
670 views
Is there any way to check whether a language is regular or not without using Pumping lemma?
0 votes
0 votes
2 answers
2
1 votes
1 votes
0 answers
3
atul_21 asked Nov 29, 2017
236 views
Infinite union of regular languages Is not regular language. But if there is "Union of infinite lengths regular language " then it wud beRegular? CFL ?
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