{"id":3326,"date":"2021-12-08T03:45:18","date_gmt":"2021-12-08T03:45:18","guid":{"rendered":"https:\/\/bolif.telkomuniversity.ac.id\/?page_id=3326"},"modified":"2021-12-08T05:42:53","modified_gmt":"2021-12-08T05:42:53","slug":"teori-bahasa-dan-automata","status":"publish","type":"page","link":"https:\/\/bolif.telkomuniversity.ac.id\/en\/teori-bahasa-dan-automata\/","title":{"rendered":"Teori Bahasa dan Automata"},"content":{"rendered":"<p style=\"text-align: justify;\"><strong>Teori Bahasa dan Automata &#8211; <em>Languages and Automata Theory<\/em><\/strong><br \/>\nDeskripsi Mata Kuliah &#8211; Course Description:<br \/>\nPada 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.<\/p>\n<p style=\"text-align: justify;\"><em>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.<\/em><\/p>\n<p style=\"text-align: justify;\">Pustaka &#8211; Bibliography:<br \/>\nUtama:<br \/>\n1. Hopcroft, J.E., Rajeev Motwani, and Jeffery D. Ullman, \u201cIntroduction to<br \/>\nAutomata Theory, Languages, and Computation 2nd Edition\u201d, Addison-Wesley,<br \/>\n2001<br \/>\n2. Sipser, Michael, \u201cIntroduction to the Theory of Computation 3rd Edition\u201d,<br \/>\nCengage Learning, 2013<br \/>\n3. Brookshear, Glen J., \u201cTheory of Computation : Formal Language, Automata and<br \/>\nComplexity\u201d, The Benjamin\/Cummings Publishing Company, 1989<br \/>\nPendukung:<br \/>\n1. Utdirartatmo, Firrar, \u201cTeknik Kompilasi\u201d, Penerbit Graha Ilmu, Yogyakarta,<br \/>\n2005<br \/>\n2. Hariyanto, Bambang, \u201cTeori Bahasa, Otomata, dan Komputasi serta<br \/>\nTerapannya\u201d, Penerbit Informatika, Bandung, 2004<br \/>\n3. Linz, Peter, \u201cAn Introduction to Formal Languages and Automata 5th Edition\u201d,<br \/>\nJones &amp; Bartlett Learning, 2012<br \/>\n4. Revesz, Gyorgy E., \u201cIntroduction to Formal Languages\u201d, McGraw Hill Book<br \/>\nCompany, 1985<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Teori Bahasa dan Automata &#8211; Languages and Automata Theory Deskripsi Mata Kuliah &#8211; 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. [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-3326","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/bolif.telkomuniversity.ac.id\/en\/wp-json\/wp\/v2\/pages\/3326","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/bolif.telkomuniversity.ac.id\/en\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/bolif.telkomuniversity.ac.id\/en\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/bolif.telkomuniversity.ac.id\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/bolif.telkomuniversity.ac.id\/en\/wp-json\/wp\/v2\/comments?post=3326"}],"version-history":[{"count":2,"href":"https:\/\/bolif.telkomuniversity.ac.id\/en\/wp-json\/wp\/v2\/pages\/3326\/revisions"}],"predecessor-version":[{"id":3328,"href":"https:\/\/bolif.telkomuniversity.ac.id\/en\/wp-json\/wp\/v2\/pages\/3326\/revisions\/3328"}],"wp:attachment":[{"href":"https:\/\/bolif.telkomuniversity.ac.id\/en\/wp-json\/wp\/v2\/media?parent=3326"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}