Automata and formal languages 06-DAUTLI0
The aim of the course is to present the theory of formal languages and automata in a rigid, mathematical way as a branch of theoretical computer science. On the other hand, the course introduces and discusses notions and results which now form a part of an elementary knowledge of a working computer scientist. The course can serve as a basis for further, advanced theoretical study in e.g. computability theory or theory of computational complexity, or in a wide range of applications, e.g. in computational linguistics. Lab sessions provide a link between theoretical knowledge and programming practice.
Course coordinators
Bibliography
J. E. F. Friedl, Mastering Regular Expressions, O'Reilly, 1997.
J. E. Hopcroft, R. Motwani, J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 2001.
D. Kozen, Automata and Computability, Springer, New York, 1997.
G. E. Revesz, Introduction to Formal Languages, McGraw-Hill Book Company, New York, etc. 1983.
M. Sipser, Introduction to the Theory of Computation. Thomson Course Technology, 2006.
Additional information
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: