Theoretical informatics II Aim of the course and its syllabus Recommended literature Coursework Examination Your questions

Theoretical informatics II Lecturer: Josef Hynek Josef.Hynek@uhk.cz Aim of the course: To make the students familiar with selected aspects of theoretical informatics in order to be prepared for their independent research activities in the area of applied informatics. The scope of the course reflects the fact, that some students did not acquire sufficient level of preliminary knowledge in this area during their previous studies and so it is necessary to bring them into line with students who already passed some courses in theoretical informatics.

Syllabus: Theory of formal languages (languages, Chomsky hierarchy, grammars and their utilization). Theory of automata (finite automata, pushdown automata, Turing machines, relationships between various types of automata and grammar, Church-Turing thesis) Theory of computability (decidable problems, universal Turing machine, the halting problem, undecidable problems and their implications, Gödel theorem, Turing machines with oracle) Theory of complexity (time and space complexity, algorithm analysis, classes of complexity, NP-complexity, approximate solutions to hard problems)

Reading list: Sipser, M.: Introduction to the Theory of Computation Course Technology, 2nd Ed., Thomson, Boston, MA, 2006. Linz, P., An Introduction to Formal Languages and Automata, Fifth Edition. Jones & Bartlett Learning, 2001. Jančar, P., Kot, M., Sawa, Z.: Teoretická informatika. VŠB – Technická univerzita Ostrava, 2007. (in Czech only) Wayne Goddard: Introducing the Theory of Computation. Jones & Bartlett Learning, 2008. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation (2nd Ed.), Addison Wesley, 2000. Garey, M.R.: Johnson, D.S.: Computers and Intractability : A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences), W.H. Freeman 1979. Cormen, T. H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, (2nd Edition), MIT Press 2001.

Organization of the course Introductory meeting Reading & independent work of students Consultations – if needed Josef.Hynek@uhk.cz in person (prior arrangement is needed) Preparation of your coursework (paper) Examination

Coursework (paper) Topic: focused on specific aspects of theoretical informatics related to the subject of your dissertation (or related to some area of your interest if you are unable to find any relationship to your dissertation) Length: 3000 words approximately Format: “common” conference/journal paper (Word, PDF) Submission: by e-mail (Josef.Hynek@uhk.cz ) Deadline: 3. 1. 2020 Thereafter: I will need approximately two weeks to read it and then (if it is ok) you will be invited for oral exam

Examination Examination comprises of two parts: First of all, we will discuss your paper Secondly, your knowledge of theoretical informatics will be assessed in the areas  of theory of automata and formal languages theory of computability and theory of complexity The scope is given by the recommended textbook

Theoretical informatics II Your questions?