Lecture 5 - Context Free Languages (Part 1/8)

[@ehunt911]

This guy is awesome - really helpful and seems like he'd be pretty comical in the classroom. Wish I could take class with him!

[@GreenStarMidoriBoshi]

determinist finite automata are used a lot in string matching algorithms, such as KMP. lots of big companies, such as google, need efficient algorithms for string matching. FSM are not that unuseful as they look like:)

[@linuxaddict11111]

I would probably still not understand CFG's if it weren't for this particular lecture. I am indebted, sir.

[@troindx]

I'm about to pass an exam on compilers by revising these videos in just a day :) awesome!!

[@saske23b]

thank you very much for your theory of computation series, helps me alot at university.

[@xxKipper]

We know that L1 = {a^n : n ≥ 0} is a cfl but is L2 = {a^(n^2) : n ≥ 0} ∪ {a^n : n ≥ 0} a context free language? Also is L3 = {a^n : n = (k^3), k ≥ 0} a cfl?

[@widdershins_clockwise]

Seriously, thank you so much for these videos.

[@MrDanielphillis]

thoroughly enjoyed your vids on Discreet Math..Thank you !!

[@bhrajgopal]

i have a doubt in cfg's
given language L={a^n b^n c^n }
^ is power operator and n>0
is this the cfg for given language ?
A->aB
B->aB|bC
C->bC|cD
D->cD|E
where E=epsilon
A,B,C,D are variables
a,b,c,d are terminals

[@sscprp]

Nice Lecture. Thank you. Ótima aula. Obrigado.

[@Slacquerr]

Am I getting credit for this?

[@zagabel]

you keep talking about Dimitri spending time. Does that mean this class has a lab or tutorial lecture. We barely had enough lectures when I took that course.

[@saptarshisamanta1729]

Nice

[@avnisharma4902]

thanks. God bless you.

[@dumisanid8733]

He looks like Messi

[@yamannassar]

hgf

[@Oxfist]

Thumbs up if you're in love with Donna.