248 views

1 Answer

Related questions

561
views
1 answers
1 votes
Naveen Kumar 3 asked Apr 14, 2019
561 views
Show a derivation tree for the string $aabbbb$ with the grammar$S\rightarrow AB|\lambda,$A\rightarrow aB,$B\rightarrow Sb.$Give a verbal description of the language generated by this grammar.
164
views
0 answers
0 votes
Naveen Kumar 3 asked Apr 14, 2019
164 views
Show that the complement of the language $L =$ {$a^nb^mc^k : k = n + m$} is context-free.
225
views
1 answers
0 votes
Naveen Kumar 3 asked Apr 14, 2019
225 views
Show that the complement of the language $L=$ {$ww^R:w∈$ {$a,b$}$^*$} is context-free.
351
views
1 answers
0 votes
Naveen Kumar 3 asked Apr 14, 2019
351 views
Show that the following language is context-free. $L=$ {$uvwv^R:u,v,w∈$ {$a,b$}$^+,|u|=|w|=2$}.