Register

CFL or CSL

647 views
1 1 vote

Is L={ ambncndm, m$\neq$ n}  CFL na ?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · GATE2017 CE, INNext → · BC Normal form
← Previous in category · self doubtNext in category → · CFL or not
Position:
Show:

Related questions

0 0 votes
0 0 answers
574
574 views
h4kr asked Dec 23, 2022
574 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...
0 0 votes
3 3 answers
2.4k
2.4k views
!KARAN asked Jan 17, 2019
2,378 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.
3 3 votes
2 answers 2 answers
2.4k
2.4k views
kanahanin asked Dec 8, 2015
2,416 views
CFL or CSL ?
Is the language given by $ww^R ww^R$, where $w$ is any string over the binary alphabet, Context Free or Context Sensitive?
0 0 votes
0 0 answers
535
535 views
Vipin Rai asked Aug 12, 2018
535 views
CFL or CSL
Are following languages CFL? If so please explain me how to draw a PDAL1 = { xww$^{R}$ : x,w $\in$ (0,1)$^{+}$ }L2 = { ww$^{R}$x : x,w $\in$ (0,1)$^{+}$ } L3 = { ww : w...