[Discrete Mathematics] Formal Languages

We do a quick introduction to formal langauges. The alphabet, rules, and language.

*--Playlists--*

*--Recommended Textbooks--*

Hello, welcome to TheTrevTutor. I'm here to help you learn your college courses in an easy, efficient manner. If you like what you see, feel free to subscribe and follow me for updates. If you have any questions, leave them below. I try to answer as many questions as possible. If something isn't quite clear or needs more explanation, I can easily make additional videos to satisfy your need for knowledge and understanding.

[mayareece]

THANK YOU!! My professor taught this in class, I read the textbook and I've been searching for videos to help and yours really broke it down. Thank you! :-)

[VongolaBossXl]

Your discrete math video covers most contents of my courses. They are are very easy to follow and understand. I can't thank you enough :D best discrete math videos on YouTube

[irenepokharel]

I have an exam on DM tomorrow, it's nearly midnight and your voice is making me sleepy.
But I understood, thank you, good night!!!!

[joni]

Hey there thanks for the video. I do not want to be to picky but... if u use the 2nd rule at 8:00 min, you should get abba and 3rd rule you should get abaaba. I thought you have to insert {a, b}* at the position S which is aSa -> a(bSb)a->ab(aaS)ba

[starwyvern]

Thank you for this - I'm in the last few days of an online course and the formal languages unit is just not clicking. I think this helps

[qaipak]

This helped. Learning representation of formal languages (in theory of computation) and my basics were a bit weak.

[jodo]

My name is Kprst and I am offended by this video.

[thaianle]

Thanks for the video. Easy to understand and digest. Other explanations video were like: alphabet is, then language is, then formal language is, and that it's.

[MalamIbnMalam]

Greetings, let's assume the following: Let G = (V, T, S, P) be the phrase-structure grammar with V = {0, 1, A, S}, T={0, 1} and set of productions P consisting of S->1S, S->00A, A-> 0A and A-> 0


Select all of the following that belong to this language.


A.1000


B.11000


C.11001


D.111000

[EpicGamer-uxtu]

Incredibly useful video. Thank you! <3

[sumayahabdullah]

How would you say that there is an even amount of a’s and an even amount of b’s.

[AssasinMilo]

Wait I thought the list of possible words is not countable because you can make the same argument you make for why the decimals are uncountable right, or am I mistaken?

[TheTacticalDood]

Did you explain regular expressions ? I searched but I couldn't find anything.

[zstar]

Hey hope you are doing alright just I wanna say that
GOD loved the world so much he sent his only begotten
son Jesus to die a brutal death for us so that we can have eternal life and we can all accept this amazing gift this by simply trusting in Jesus, confessing that GOD raised him from the dead, turning away from your sins and forming a relationship with GOD.