Register

class of language

458 views
3 votes
3 votes
is the language L is CFL ??
L={w| w is a palindrome over (a,b,c)}
User Avatar

1 Answer

Best answer
3 votes
3 votes

A language is context free if there exist a CFG for G such that $L=L(G)$.

So CGF for above language L={w| w is a palindrome over (a,b,c)} is

$S\rightarrow aSa|bSb|cSc|a|b|c|\epsilon$.

So given language L is context free.

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
anupamsworld asked Aug 29, 2022
620 views
Identification of Regular Language | TOC | Practice Question | Unacademy Class
Which of the following is/are Regular? A] $\left \{ XWYW^{R} \space\ | \space\ W,X,Y \in \left \{ a,b \right \}^{+} \right \}$ ... D] None R => Reverse Please describe your answer.
Which of the following is/are Regular?A] $\left \{ XWYW^{R} \space\ | \space\ W,X,Y \in \left \{ a,b \right \}^{+} \right \}$B] $\left \{ WXW^{R}Y \space\ | \space\ W,X,Y...
User Avatar
0 votes
0 votes
1 answer
2
Mayankprakash asked Jan 24, 2019
305 views
Class of language
Please suggest me in briefly for revision . How to we test regular,dcfl,cfl,recursive and recursive enumeranle. Eg say if we can find the pattern it's regular. Please help
Please suggest me in briefly for revision .How to we test regular,dcfl,cfl,recursive and recursive enumeranle.Eg say if we can find the pattern it's regular.Please help...
User Avatar
0 votes
0 votes
0 answers
4
CS.user asked Jan 13, 2019
650 views
MadeEasy Test Series: Theory of Computation- Indentify Class Language
$L^{*}-\{{\epsilon }\}=L^{+}$. True or False? (Given L is a language)
$L^{*}-\{{\epsilon }\}=L^{+}$. True or False? (Given L is a language)
User Avatar
Link Copied!