Teori Bahasa dan Otomata

1 Teori Finite Automata : konsep simbol, kata dan tata bahasa, dan jenis-jenis otomata
2 Formal Proof terhadap Regular Language, Perancangan DFA, Implementasi FA dalam bentuk program
3 Non Deterministic Finite Automata (NFA)
4 NFA dengan epsilon dan Aplikasi FA
5 Regular Expression (RE)
6 Properti RegularExpression
7 Minimization dari Automata
8 Context Free Grammar
9 Chomsky Normal Form (CNF)
10 Properties dari Context Free Language (CFL)
11 Pengantar Compiler
12 Pushdown Automata (PDA)
13 Studi kasus PDA
14 Pengantar Turing Machine

Sumber: Silabus Informatika 2020 (PAIK6702).

Alfred V. Aho, Monica S. Lam, Ravi Sethi, and Jeffrey D. Ullman. , 2014, Compilers: Pronciples, Techniques and Tools, second Edition. Pearson, Addision Wesley
Eugene Xavier S.P., 2005, Theory Of Automata, Formal Languages and Computation, New Age International Pubishers
Hopcroft, J. E. ,2013, Introduction to Automata Theory, Languages and Computation: For VTU, 3/e. Pearson Education India
JAMES A. ANDERSON, 2006, Automata Theory with Modern Applications, Cambridge University Press, Cambridge, New York
Martin, John C. 2011,Introduction to Languages And The Theory Of Computation, Fourth Edition, Published by McGraw-Hill, a business unit of The McGraw-Hill Companies, Inc., 1221