CS525 \ lec03 2012-01-25
CFGs, or nondeterministic pushdown automata, model recursion. Does that add anything to our computational power?
If we have no ability to use a stack, or recursion, we can actually simulate it in a high leve
CS525 \ lec04 2012-02-01
Problem Set #2 Solutions
be a deterministic Turing machine:
We will show a construction of a deterministic Turing machine
with only 3 states that simulates
CS525 \ lec02 2012-01-18
Week 3 midterm: at the end of next week the first midterm will be published. We will have ~2-3 hours (including for
technical stuff) once we check it out.
The final exam will also be online.
CS525 \ lec01 2012-01-11
Should attempt the exercises at the end of the chapter, and can discuss them on the discussion board.
DFA deterministic finite automata
) is a DFA wh