Karabakh University Courses
In this section
List of all courses
[KOM 413] Formal Languages and Automata Theory
Instruction Language
Azerbaijani
Course Type
Elective - Block 5
Course Description
This course explores the mathematical foundations of computation and the characterization of formal languages. The curriculum covers finite automata, pushdown automata, and Turing machines, alongside the hierarchy of formal grammars. Students study the relationship between language classes and the abstract machines that recognize them, focusing on regular expressions and context-free grammars. The course emphasizes the limits of computation, including decidability and the Halting Problem. By the end of the semester, students will understand the theoretical constraints of computer science and be capable of applying these models to compiler design and text processing.
We use cookies in the delivery of our services. To learn about the cookies we use and information about your preferences and opt-out choices, please click here. By using our platform you agree to our use of cookies.
Decline
Accept
