Planar Machines in Theory

Published: 21 May 2024
on channel: 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.

On this page of the site you can watch the video online Planar Machines in Theory with a duration of hours minute second in good quality, which was uploaded by the user Easy Theory 21 May 2024, share the link with friends and acquaintances, this video has already been watched 1,452 times on youtube and it was liked by 47 viewers. Enjoy your viewing!

338,206

6.2K