Teori Bahasa dan Automata – Languages and Automata Theory
Deskripsi Mata Kuliah – Course Description:
Pada mata kuliah ini mahasiswa akan belajar konsep dasar Teori Automata dan Bahasa: grammar, hirarki bahasa Chomsky, Finite Automata, Pushdown Automata, Mesin Turing, dan persoalan NP. Mahasiswa akan belajar memodelkan penyelesaian persoalan menggunakan mesin FA, Pushdown Automata, dan Mesin Turing.
In this course students will learn the basic concepts of Automata and Language Theory: grammar, Chomsky language hierarchy, Finite Automata, Pushdown Automata, Turing Machines, and NP problem. Furthermore, students will learn to model a problem solution using FA, Pushdown Automata, and Turing Machine.
Pustaka – Bibliography:
Utama:
1. Hopcroft, J.E., Rajeev Motwani, and Jeffery D. Ullman, “Introduction to
Automata Theory, Languages, and Computation 2nd Edition”, Addison-Wesley,
2001
2. Sipser, Michael, “Introduction to the Theory of Computation 3rd Edition”,
Cengage Learning, 2013
3. Brookshear, Glen J., “Theory of Computation : Formal Language, Automata and
Complexity”, The Benjamin/Cummings Publishing Company, 1989
Pendukung:
1. Utdirartatmo, Firrar, “Teknik Kompilasi”, Penerbit Graha Ilmu, Yogyakarta,
2005
2. Hariyanto, Bambang, “Teori Bahasa, Otomata, dan Komputasi serta
Terapannya”, Penerbit Informatika, Bandung, 2004
3. Linz, Peter, “An Introduction to Formal Languages and Automata 5th Edition”,
Jones & Bartlett Learning, 2012
4. Revesz, Gyorgy E., “Introduction to Formal Languages”, McGraw Hill Book
Company, 1985
