in Theory of Computation
331 views
0 votes
0 votes
If w is a string and wR is reverse of it then what language it wull satisfy if I concatenate like w.wR ? Is it regular of cfl ?
in Theory of Computation
331 views

4 Comments

should be CFL, it accepted by NPDA.

check this https://gateoverflow.in/222710/pda-doubt

1
1
Here .(dot) means concatenation or is it a symbol from the alphabet?
0
0

@sakharam

read the question clearly, it means concatenation only

0
0
I thought so but lets say the new language has . as a part of the alphabet {a,b,.} assuming a and b the symbols were in the previous language. :-)

In this case it would have been Deterministic CFL

Thanks for the clarification
0
0

1 Answer

0 votes
0 votes
w= regular(dfa) and $w^{r}$= regular(dfa)  w.$w^{r}$ also a dfa

1 comment

your answer is wrong because there is a need of comparison between w and $w^{r}$ so it can't be handle by dfa,.
0
0

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
1 answer
2
0 votes
0 votes
1 answer
3
0 votes
0 votes
1 answer
4
saif asked in Theory of Computation Aug 17, 2018
1,534 views
saif asked in Theory of Computation Aug 17, 2018
by saif
1.5k views