A nice problem and proof about languages
Here we prove the following problem about languages: if L1, L2, and L3 are languages, then (L1 intersect L2) concat L3 = (L1 concat L3) intersect (L2 concat L3).
Thanks to the following supporters of the channel for helping support this video. If you want to contribute, links are below.
Dolev Abuhazira, Josh Hibschman, Micah Wood, Morgan Jones, Patrik Keinonen, Simone Glinz, Tao Su, Timothy Gorden, unit220, Valentine Eben
Easy Theory Website: https://www.easytheory.org
Become a member: / @easytheory
Donation (appears on streams): https://streamlabs.com/easytheory1/tip
Paypal: https://paypal.me/easytheory
Patreon: / easytheory
Discord: / discord
Merch:
Language Hierarchy Apparel: https://teespring.com/language-hierar...
Pumping Lemma Apparel: https://teespring.com/pumping-lemma-f...
If you like this content, please consider subscribing to my channel: / @easytheory
▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about it. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.
The views expressed in this video are not reflective of any of my current or former employers.
On this page of the site you can watch the video online A nice problem and proof about languages with a duration of hours minute second in good quality, which was uploaded by the user Easy Theory 14 April 2022, share the link with friends and acquaintances, this video has already been watched 642 times on youtube and it was liked by 20 viewers. Enjoy your viewing!
