A nice problem and proof about languages

Publicado el: 14 abril 2022
en el canal de: Easy Theory

642

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.

En esta página del sitio puede ver el video en línea A nice problem and proof about languages de Duración hora minuto segunda en buena calidad , que subió el usuario Easy Theory 14 abril 2022, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 642 veces y le gustó 20 a los espectadores. Disfruta viendo!

2,474

106