Formal Languages and Automata Theory

This course prepares students to apply finite automata and regular expressions to recognise formal languages, apply context-free grammars, pushdown automata and Turing machines, and apply automata concepts in the design of lexical and syntax analysers. Study materials: Foundations of Programming Languages (FPL), Mathematical and Statistical Foundations (MSF).

Topics

1. Finite automata and regular expressions for recognising formal languages
2. Context-free grammars, pushdown automata and Turing machines
3. Automata concepts in the design of lexical and syntax analysers

Each course outcome derives from one programme outcome.

1. CPMK0603

   Students are able to apply the basic concepts of mathematics and statistics to solve computational problems.

   CPL06
2. CPMK0606

   Students are able to apply the basic concepts of computer systems to solve computational problems.

   CPL06

CPL06

Analyse and implement fundamental concepts of mathematics, statistics, algorithms and computer systems as the foundation of computing.

• IF2117 Teori Bahasa Formal dan Otomata · 3 credits · Kode, semester 3→4