Being competent to use formal models of computability as a basis for the theory and practice of program languages and compilers. To be competent to follow a higher course of theory of computation. Introduction to languages, regular and context-free languages, finite automata and push down automata, grammars and relationship between certain types of automata and languages