log in
Formal
Languages
and the
Theory of
Computation
Fall 2019
course
home
syllabus
resources
class notes
assignments
site
about
help
..
.
class notes
intro class
finite automata
regular expression
context free
parsing code
Turing machines
philosophy of mind
how not to prove that P \( \neq \) NP
minesweeper is NP-complete
Jim's post correspondance search
information theory topics
parallel computing topics
https://cs.marlboro.college
/cours
/fall2019
/formal_languages
/notes
/home
last modified Thu November 21 2024 10:24 am
