Recent questions tagged context-free-language

0 votes
0 answers
7
0 votes
1 answer
8
0 votes
1 answer
12
Convert this language to Push Down Automata – {a^n u | u ∈ {a, b}*, |u| = n, n ≥ 0}
0 votes
1 answer
15
1 votes
1 answer
16
$a^{p}b^{p}a^{p} where p>=0$ can i write this lang. as cfl when a come push in to the stack when b skip all b’s again when a pop all the a from the stack …..
1 votes
1 answer
18
The complement of the languages:i) {ww | w in (0+1)*}ii) {$a^n b^nc^n$ | n>1} area) Context Free b) Not Context Free c)are DCFL’s d)None
0 votes
1 answer
20
0 votes
2 answers
22