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.
@warden00610 жыл бұрын
Amazing class, thank you
@ditook-codingandtech47624 жыл бұрын
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 :)
@Johncena-bk1lg5 жыл бұрын
Woah hold on just a second..........you're not indian?!
@bruba24484 жыл бұрын
Thank you
@darsh_shukla8 жыл бұрын
Can we write the grammar rule for L={a^i b^i | i>0} as S->aSb , S->ab , S->^ (concate).
@unixbash7 жыл бұрын
That girl has been annoying, the last three videos!