+Ville Peltoniemi * basically means you're either allowed to ignore the starred bit completely, or you get to add as many copies of it as you want. These are weird edge cases but visualizing the equivalent FSMs and seeing what strings they accept can help. Due to the way they're constructed, anything with a * at the end will accept the empty string and anything that gets concatenated with the empty set will end up with an empty set of final states.
I didn't undestand why the example a(bUc)empty will be a empty language, it couldn't be {ab,ac} considering the last character or string will be empty?
This is probably the most vital piece of information I have encountered regarding computing. It makes it all make sense.
you definetly live up to your name, professor. This video feels like magic. 😂
Thank you for this great lecture.
The empty set star rustles my jimmies.
+Ville Peltoniemi * basically means you're either allowed to ignore the starred bit completely, or you get to add as many copies of it as you want.
These are weird edge cases but visualizing the equivalent FSMs and seeing what strings they accept can help. Due to the way they're constructed, anything with a * at the end will accept the empty string and anything that gets concatenated with the empty set will end up with an empty set of final states.
I wish you were my professor. Thank you for the video. It was very helpful
Well, that finally explained regex. Wonderful!
Very useful, carefully and clearly explained.
I didn't undestand why the example a(bUc)empty will be a empty language, it couldn't be {ab,ac} considering the last character or string will be empty?
Why doesn't the language described by a(bUc)d contain { abcd }?
I am sort of late but here you go: a(bUc)d=a{b,c}d=(a{b,c})d={ab,ac}d={abd,acd}
12:46 No R😂😢
Thank you so much for this. was struggling! lol
Thanks! for making it easy to follow.
Happen2Bme, Glad my videos help!
Thank You Sir
well done thanks
Thank you!
many thanks
didn't know they learn regular expressions at hogwarts, nuce
yêu