Question

If L is a regular language over alphabet (a, b), let L' be the set of ' strings in L that are pallndromes.

Which of the following statement is false?

Answer 1

Option (a,b,c)

It L is finite then L' is also finite so L' can be regular.
So, option (a) is false. If L is set of all strings over the given alphabet then L' is non-regular.
So option (b) is false.
Option (d) is true.
Option (c) is false for the language a* .