- Link to the protocol of 2016/2017 evaluation.
- Previous year's pages:
- JFLAP, a software for
experimenting with formal languages topics including
(non-)deterministic finite automata, grammars and Turing machines.
Automata tutor: Open an account there and enroll in the course with ID 164FAFL-2 using the password KAUA2ON4.
There are a few exercises there you can try for your own benefit! (Even if the tool gives a "grade" they are not at all associated to the examination of the course!)
The tool is a bit experimental so just ask me if there is anything strange!
- Turing machine simulator: I have not tried it myself but I was told it was useful.
- Short notes on:
- Basic notions like sets,
(The responsible of the course would like to thank Einar Steingrímsson for these notes.)
Note: There are 2 typos in the second page on set theory; the right most B in the distributive laws (1) and (2) should be an A.
- Koen Claessen's notes on proof methods and structural induction.
- Ana's notes on inductive sets and induction, and on Pumping lemma.
- Basic notions like sets, relations and functions.
- Online book on Mathematics
for Computer Science by Lehman, Leighton and Meyer. Available under the
terms of the Creative Commons Attribution-ShareAlike 3.0 license.
- Link to the course book's web page: Introduction to
Automata Theory, Languages, and Computation, by Hopcroft, Motwani
and Ullman. Addison-Wesley.