►2017 Fall - 304 - Foundations of Computer Science - Syllabus
▼2 Lectures, Assignments, and Exercises
2.1 dfa
2.2 nfa
2.3 re
2.4 cfl
2.5 tms
2.6 vtms
2.7 dec
2.8 undec
2.9 Paper
2.10 Presentation
2.11 Midterm
2.12 Final
    ← prev  up  next → 

2.6 vtms

This exercise is optional. Refer to the exercise policy for details.
Do the exercises in section 3.2 in the textbook.
Implement an interpreter for multitape Turing machines.
Implement an interpreter for nondeterministic Turing machines.
(Hardcore) Write a compiler from multitape Turing machines to standard Turing machines.
(Hardcore) Write a compiler from nondeterministic Turing machines to multitape Turing machines.

    ← prev  up  next →