Question & Answer: Let PALI (L) = {w|w element L and w^R element L}. Does PALI preserve regu…..

PALI(L)={w|w€L and w^R €L}

It preserves regularity.

we can construct a DFA which accept the strings and reverse of the strings, so the given language is regular.

DFA has finite no.of states and we can tell whether a string is accepted by the DFA or not so it is decidable.