in Theory of Computation retagged by
567 views
0 votes
0 votes

L={wxwr∣ w,x∈(a,b)*}

Is this language regular language?

Plz give transition diagram or table?

in Theory of Computation retagged by
567 views

2 Comments

What (a,b)stands for??

Or its (ab)

0
0
yes regular..
0
0

2 Answers

6 votes
6 votes
Best answer

$L=\{wxw^R\;\mid \; w,x\in \{a,b\}^*\}$

Language is regular , we can get all string over $\{a,b\}$ from $x$ by putting $w= \epsilon$.

Regular expression is $(a+b)^*$

selected by

4 Comments

@Praveen Sir, in this language , there is no limitation on the length of 'x' .. so it can be (a+b)* .. but sir, I think this language contain all the strings which starts and end with the same symbol... So according to me, R.E. should be a(a+b)*a + b(a+b)*b...Sir , Please clear my doubt 

0
0
@Ankit

That is different language.

$\large L=\left \{ wxw^{r}|w,x\ \epsilon (a,b)^{+} \right \}$.
0
0
@Manoj , Sir got it.. thanks :)
1
1
0 votes
0 votes
yes its regular u can take any string n make was e and remaining or all string as x
by

Related questions