Planar Machines in Theory

Pubblicato il: 21 maggio 2024
sul canale di: 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.

In questa pagina del sito puoi guardare il video online Planar Machines in Theory della durata di ore minuti seconda in buona qualità , che l'utente ha caricato Easy Theory 21 maggio 2024, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 1,452 volte e gli è piaciuto 47 spettatori. Buona visione!

2,666