How to Union two Regular Languages with the Product Construction - Easy Theory

[@EasyTheory]

Next video, DFA/NFA to regular expression! kzbin.info/www/bejne/i3y8p4NulrhqnK8

[@younlesslin3497]

Best course I’ve ever seen, thank you sir

[@nanouk218]

Great explanation of the fine details to show an understanding of how to construct. I’ll def share with my classmates at the university.

[@mengzhang1941]

Such clear explanation. Thank you!

[@EasyTheory]

Thanks very much!

[@armghan2312]

i'm baffled, my mind literally exploded... thanksssss man!!! so easily cleared!

[@realguyyy]

Haha i love that intro 😂

[@EasyTheory]

Lol thanks!

[@michelleIX]

my first thought was "He looks kinda sad"

[@brandonjames868]

Great explanation! Easy to follow.

[@EasyTheory]

Thanks!

[@oluwakoredeonasanya3267]

This is an amazing tutorial. Thank you very much this has helped me a lot

[@sonofben3322]

thank you! very concise and easy to follow

[@joeyjoeanu4910]

this is exactly what i needed thank you so much for the help

[@renzondaziano4880]

thanks mate! greetings from Copenhagen

[@thirumeniparthiban6261]

great explanation, easy to grasp. Also explain asynchronous vs synchronous products...

[@ingoandelhofs8641]

What a great tutorial! If you wanted to compute the intersection would the construction be the same (except for only marking q1 r1 a final state)?

[@EasyTheory]

Thanks! Yes (q1,r1) would be the only final state in that case.

[@ODAKAB]

you dropped this 👑

[@teejay0]

you made it so easy

[@quercus_opuntia]

this video saved my failing marraige, tysm

[@freekicksri4959]

I see you're wearing a Colgate University shirt... did you go there? I'm a senior CS major there currently. Your videos have been super helpful for my Theory class

[@EasyTheory]

I was a professor there from 2019-2020.

[@tizaf]

this just saved a life. thanks a lot :)

[@ratulhasananas3627]

Thank you sir it was very helpful for me ......

[@zeronotjelo]

Thank you. This was very hepful!

[@itsZybn]

Intro made me laugh, haha, thanks for the help!

[@glizzy5154]

actual life saver

[@feneris1416]

Thank you for the nice video! I do have a question though: in the L1 automata is r2 something like an "error" state?

[@Resident_lurker]

Wonderful video

[@user-ov5nd1fb7s]

Is there a way to continuesly add states to an NFA/DFA? I am working on a project that indexes text data from a stream. New data keeps coming in many times per second. NFA/DFA can search fast but the implementations i've seen build it once and then you can't update it. This is obviously a problem, when you have an input stream.

[@shahbodshs6693]

that was amazing thanks!!!!!!!!!!

[@FreeDomSy-nk9ue]

Do you have a similar video but on the intersection?

[@EasyTheory]

Yes: kzbin.info/www/bejne/eaa8i3ypd7iaq9k, but the construction is exactly the same except for what states are marked as final.

[@t_balle1620]

can we do the union of 2 languages without having to use the product construction?

[@EasyTheory]

Excellent question! I think there are examples where every state produced by the product construction are necessary (and no smaller DFA exists), so in general yes it is required. However, you can potentially make the DFA directly without having to use the product construction.

[@t_balle1620]

@@EasyTheory allright, thanks!

[@LlamaBG]

you are right, 2 times 3 is 6

[@metafates]

Thank you!

[@avramcs]

straight legend

[@charged7177]

I think that there is a small error. To be mathematically correct , shouldnt be RxQ where R the state set of L1 and Q the state set of L2?

[@cansnlale2292]

that's what i need!!

[@salman8562]

I like the dyslexic "HOME" at the top.

[@EasyTheory]

LOL yes didn't realize it was in the shot. Not sure if it's dyslexic though ;)

[@salman8562]

@@EasyTheory no as I have your attention, solve this dfa question for me {w belongs to {a,b}: every string in w contains no more than 2 occurences of "bb"} (The string "bbb" should be viewed as two occurence of "bb")

[@umairalvi7382]

Does the cross product method give minimal dfa? Or do we have to make it minimal?

[@EasyTheory]

umair alvi the answer is no, I prove that it's not always minimal here: kzbin.info/www/bejne/jnOqmJSOop5nm9k. You should run some minimization algorithm after forming the product DFA.

[@yassinethlija4839]

Thanks Doc

[@jk47nitk]

Thank you .

[@MrBrainStarX]

Why do you have so many private videos in the playlist ?

[@EasyTheory]

Videos I've made that are coming up but aren't public yet (will start appearing tomorrow)!

[@MrBrainStarX]

@@EasyTheory awesome :) tomorrow is my exam, wish me luck :P

[@EasyTheory]

MrBrainStarX good luck! What material specifically?

[@MrBrainStarX]

@@EasyTheory automata theory(DFA,NDFA,PDA), language theory,logic, Turing machines, complexity theory (P, NP, NPC)

[@MrBrainStarX]

@@EasyTheory thx :)

[@umairalvi7382]

How to the difference operation on two dfa's?

[@EasyTheory]

umair alvi note that the difference of languages A, B is A-B, the set of strings in A *and not* in B. (Use that as a hint.)

[@umairalvi7382]

@@EasyTheory a-b=a intersection not b Am i right sir?

[@EasyTheory]

umair alvi yes!

[@kaveenjayamanna3076]

thank you

[@nehakattoju8766]

thank you : D

[@rileyacosta9168]

legend

[@acoinhastwosides5239]

is it a minimal DFA?

[@EasyTheory]

Not always, as I show here: kzbin.info/www/bejne/jnOqmJSOop5nm9k&ab_channel=EasyTheory

[@free-palestine000]

Can you do NFA to DFA conversion pls

[@EasyTheory]

Next video (on Monday) is NFA to regex, then right after is NFA to DFA!

[@free-palestine000]

Easy Theory cool thanks 🙏

[@huatutu-u5l]

awesome

[@jimjim3979]

Why are you sad tho😢. Great video

[@solidwaterslayer]

Last time I checked 2 * 3 = 6 loooooooooooooooooooool

[@Dylan12kpo1k2pDylan]

Yummy work

[@RenaudAlly]

Nice thumbnail LUL

[@nitsuj1001]

You look like Luke Skywalker

[@hitarthas4076]

you saved me 🫡

[@noid8985]

Thank you!