The purpose of this course is to explain the concept of abstract machines and automata, and the course aims to help students for understanding the limitations of computers

An overview of automata theory, formal languages and Kleene closure, Regular expressions and regular languages, Transition graph, Kleene theorem, Finite automaton with outputs, Meely and Moore machines, Turing theory, Turing machines, Halting problem, decidability of a problem, computability and Church thesis