Teaching theoretical computer science in January
In January I will give six hours worth of exam preparation for this year's theoretical computer science master's students.
We will cover the following topics:
- Deterministic and Nondeterministic Finite Automata, reduction from NFA to DFA and pumping lemma
- Context-free and Context-sensitive grammars and corresponding languages and pumping lemma as well as the word problem in Context-free grammars
- Basic complexity theory (P, NP, NP-Complete), decidability and reductions between several NP-Complete problems
I am looking forward to it.
Previous: Haskell/DG , Next: wordpress certificate error preventing upgrade
Comments and Discussion is provided by Disqus. They are tracking site and user interaction. Please refer to their privacy policy for information about data usage and retention. If you still want to look at comments or comment yourself, enable disqus by clicking here.