Thanks so much for your great videos. The short length makes them digestible and the short recap at the beginning makes it possible to skip around without having to watch every single video in the series. They are really helping me fill the gaps in my education as I do my PhD!
Hi, Just wanted to let you know that your videos are very helpful! I couldn't find better video for Regular Grammar anywhere else. So thank you for uploading these.
Question: Say you have a state (A) which transitions on terminal character a to finale state ((f)) (A)->a((f)) How would you represent this in the conversion from NFA to regex. You say that we do not need to do this conversion, but how would we represent A->a ?
Hi Ryan, I am a little confused about the relationship between regular languages, regular grammars, and DFAs. If regular grammars are for regular languages, and regular languages always have a corresponding DFA, then shouldn't a regular grammar be deterministic rather than non-deterministic?
Thanks so much for your great videos. The short length makes them digestible and the short recap at the beginning makes it possible to skip around without having to watch every single video in the series. They are really helping me fill the gaps in my education as I do my PhD!
Your channel is amazing. Don't know why more people don't know about you. Your channel is gonna grow.
Thanks very much, hope it grows faster soon haha.
I have my Computer Theory final today and this was amazing! I love the way you explain the concepts and how passionate you are about the subject!
Thanks very much! Hope it went well
Thanks very much! Hope it went well
Thanks very much! Hope it went well
@@EasyTheory I'm back! Got a 96 on the final!! :D
@@competitivelyexplained6986 So excellent!
Thanks for keeping it real! U made good progress considering the low volume of sets u put in, nice!
Hi, Just wanted to let you know that your videos are very helpful! I couldn't find better video for Regular Grammar anywhere else.
So thank you for uploading these.
The ending to this one was a cliffhanger!
I'm grateful for your contribution. Thank you!!
some really great stuff here you have.
Question:
Say you have a state (A) which transitions on terminal character a to finale state ((f)) (A)->a((f))
How would you represent this in the conversion from NFA to regex. You say that we do not need to do this conversion, but how would we represent A->a ?
Thanks for the video!
Hi Ryan, I am a little confused about the relationship between regular languages, regular grammars, and DFAs. If regular grammars are for regular languages, and regular languages always have a corresponding DFA, then shouldn't a regular grammar be deterministic rather than non-deterministic?
NFAs are a type of DFA, and correspond to certain DFAs.
May I ask, If S-> aaB, B-> aS a regular grammar?
I was just confuse. Because strictly it will violate the production rules for Regular Grammar.
@@f4edu56 Yes it is not a regular grammar, but it (depending on the other rules) may still have a regular *language*.
Thank you very much :)
Bro, You Teach Very Well...Please Don't Stop Making More Videos 🤩🤩🤩
Regular Grammar: A --> Ba, NFA: A --B--> a? But then wouldn't B be part of the alphabet? I guess I will find out in the next video!
May I know how u record this?
With love! (And Streamlabs OBS with an iPad)
If you have short attention span like me, turning it to 1.25 speed will do the trick.
You're awesome
F to future CSCI 272 students