The course introduces some fundamental concepts in automata theory and
formal languages including grammar, finite automaton, regular expression, formal
language, pushdown automaton, and Turing machine. Not only do they form basic
models of computation, they are also the foundation of many branches of
computer science, e.g. compilers, software engineering, concurrent systems,
etc. The properties of these models will be studied and various rigorous
techniques for analyzing and comparing them will be discussed, by using both
formalism and examples.
![](http://lms.nwssu.edu.ph/pluginfile.php/51670/course/overviewfiles/0_zeeThlxTBBJmUpOP.png)
- Teacher: Aaron Jude Pael