Its an awesome lecture. I must say you have profound knowledge about the subject and its intricacies. Thanks you for this wonderful journey from regular languages to context sensitive languages and their accepting machine from finite automata to linear bounded automata. I wish you would include TM and recursively enumerable languages as well. All the best.
Can you please upload more videos i like your way of teaching just try to reduce the background noise in your videos that is the only problem. Thanks :)
Actual context sensitive language from 22:00
Woah hold on just a second..........you're not indian?!
Amazing class, thank you
Its an awesome lecture. I must say you have profound knowledge about the subject and its intricacies. Thanks you for this wonderful journey from regular languages to context sensitive languages and their accepting machine from finite automata to linear bounded automata. I wish you would include TM and recursively enumerable languages as well. All the best.
Thank you
Can we write the grammar rule for L={a^i b^i | i>0} as S->aSb , S->ab , S->^ (concate).
Can you please upload more videos i like your way of teaching just try to reduce the background noise in your videos that is the only problem. Thanks :)
That girl has been annoying, the last three videos!