Consider the language -Pal- consisting of all palindromes over alphabet - -0-1-Which of the following statements is true-

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Introduction to CFL

Consider the ...

Question

Consider the language 'Pal' consisting of all palindromes over alphabet $\sum =$ {0,1}.
Which of the following statements is true?

Every finte subset of Pal is regular

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

Every infinte subset of Pal is non-regular

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Every infinte superset of Pal is non-regular

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Pal is non-regular

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

Open in App

Solution

Suggest Corrections

Similar questions

S_{1} :

S_{2} :

S_{3} :

S_{4} :

S_{1} : \sum^{*} - {ϵ} = \sum^{+}

S_{2} : L^{*} - {ϵ} = L^{*}

\sum

L_{1}

0^{n} 1^{n} | n \geq 0

L_{2}

w c w^{r} | w ϵ

L_{3}

w w^{r} | w ϵ

w^{r}

C o n s i d e r t h e f o l l o w i n g N F A M, o v e r t h e a l p h a b e t a . L e t L M b e t h e l a n g u a g e a c c e p t e d b y t h e N F A M . L e t M d e n o t e t h e m a c h i n e o b t a i n e d b y t h e f i n a l a n d n o n f i n a l s t a t e s r e s p e c t i v e l y . T h e n w h i c h o f t h e f o l l o w i n g s t a t e m e n t s i s t r u e a b o u t L M a n d L M ?

Join BYJU'S Learning Program