Register

CFL or CSL

255 views
0 votes
0 votes
Are following languages CFL? If so  please explain me how to draw a PDA

L1 = { xww$^{R}$ : x,w $\in$ (0,1)$^{+}$ }

L2 = { ww$^{R}$x : x,w $\in$ (0,1)$^{+}$ }  

L3 = { ww : w $\in$ (0,1)$^{+}$ }

w$^{R}$ : reverse
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
0 answers
1
h4kr asked Dec 23, 2022
287 views
Is it CFL or CSL?
Is {$a^nb^nc^n$ | $n>=0$} CSL? After comparing both a and b, stack would be empty. So it can’t be CFL. So it is CSL or recursive. And does this language require more than 1 stack? Please tell how would check for the grammer of this language even if it is in CSL. Thank you
Is {$a^nb^nc^n$ | $n>=0$} CSL? After comparing both a and b, stack would be empty. So it can’t be CFL. So it is CSL or recursive. And does this language require more th...
User Avatar
0 votes
0 votes
3 answers
2
!KARAN asked Jan 17, 2019
1,789 views
CFL or CSL
Let L = $\{ a^n b^m | m , n \in \textbf{N} \text{ and m is multiple of n}\}$ How do we prove that this language is not CFL.
Let L = $\{ a^n b^m | m , n \in \textbf{N} \text{ and m is multiple of n}\}$How do we prove that this language is not CFL.
User Avatar
1 votes
1 votes
0 answers
3
Pawan Kumar 2 asked Jan 3, 2018
365 views
CFL or CSL
Is L={ ambncndm, m$\neq$ n} CFL na ?
Is L={ ambncndm, m$\neq$ n} CFL na ?
User Avatar
0 votes
0 votes
0 answers
4
Abhinav_Gupta asked Dec 14, 2017
312 views
CFL or CSL
L={wϵ (a,b,c)*| na+nb = 2nc} Is it a CFL or CSL?
L={wϵ (a,b,c)*| na+nb = 2nc}Is it a CFL or CSL?
User Avatar
Link Copied!