Models of Computation MT23, Basic definitions

Created: October 09, 2023 | Read markdown | About these notes | View in context | Study these flashcards |

Course - Models of Computation MT23^U

Flashcards

Given an alphabet $\Sigma$, what is a language $L$?

language-definition

\[L \subseteq \Sigma^\star\]

Given an alphabet $\Sigma$, what is $\Sigma^\star$?

kleene-star-of-alphabet

\[\{a _ 1 \cdots a _ k : a _ i \in \Sigma, k \ge 0\}\]

Proofs

Course - Models of Computation MT23^U

(outgoing)
Lecture - Models of Computation MT23, I^U

(incoming)
Notes - Models of Computation MT23, Languages^U

(sim: 0.704)
Notes - Models of Computation MT23, Context-free grammars^U

(sim: 0.645)
Notes - Models of Computation MT23, Regular expressions^U

(sim: 0.641)
Notes - Models of Computation MT23, Myhill-Nerode theorem^U

(sim: 0.64)
Course - Computational Complexity HT25^U

(incoming)
Notes - Computational Complexity HT25, Basic definitions^U

(sim: 0.677)