This time you don't have to program, but teachers will program for you. You are asked to give them data in the form of concept maps. The concept maps will be combined and analyzed in different ways and the results will be published later. In the same time this task works as good practicing for the exam!
Task: Draw a concept map of theory of computation - i.e. of all topics concerned in the course. Notice that there are logically four different areas you should consider: regular languages, context-free languages, recursive languages and unsolvability (total and partial). Try to combine all submaps into one whole!
The best way to begin is first to list all important concepts (e.g. finite automaton, grammar, LL(1)-grammar, minimization, etc.) and then decide whether they should be concept nodes or relations in you map. Draw concept nodes as circles or squares in your map and relations as lines or arrows between nodes. Notice that your relations can be simply: "is a special case of", "can be transformed to" or "can be proved by" etc. Draw the relations, even if you don't invent names for them!
The concept maps should be drawn by Woven stories -tool developed by Jussi Nuutinen. Send Jussi an email to Jussi (firstname.surname@cs.joensuu.fi) and ask an account and password to the system. He will also send you detailed instructions, how to use it.