Planar Machines in Theory

Publié le: 21 mai 2024
sur la chaîne: Easy Theory

1,452

Here we consider "planar" machines in the undergraduate Theory of Computing class, and whether they are possible to be made, that is, a machine whose drawing does not have edge crossings. We prove that for regular languages, context-free languages, and Turing Machine languages, there is a corresponding "planar" machine. For example, every regular language has a planar NFA.

CFG to PDA conversion:    • Context Free Grammar to Pushdown Automaton...

GoFundMe: https://www.gofundme.com/f/easy-theor...
Patreon:   / easytheoryyt
Fourthwall: https://easy-theory-llc-shop.fourthwa...
Problem Solving channel: ⁠ @easytheoryprobsolve

Timeline:
0:00 - Intro
1:38 - Planar NFAs
10:00 - Planar PDAs
13:24 - Planar Turing Machines

Easy Theory Website: https://www.easytheory.org

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.

Sur cette page du site, vous pouvez voir la vidéo en ligne Planar Machines in Theory durée heure minute seconde en bonne qualité , qui a été Téléchargé par l'utilisateur Easy Theory 21 mai 2024, Partagez le lien avec vos amis et connaissances, sur youtube cette vidéo a déjà été regardée 1,452 fois et il a aimé 47 téléspectateurs. Bon visionnage!

2,666