PROFORMA KURSUS PUSAT PENGAJIAN SAINS KOMPUTER FAKULTI TEKNOLOGI DAN SAINS MAKLUMAT UNIVERSITI KEBANGSAAN MALAYSIA

Transcription

1 PROFORMA KURSUS PUSAT PENGAJIAN SAINS KOMPUTER FAKULTI TEKNOLOGI DAN SAINS MAKLUMAT UNIVERSITI KEBANGSAAN MALAYSIA Pusat Pengajian Sains Komputer School of Computer Science TTTK3353 SEMESTER I SESI 203/204 Pensyarah/Lecturer: ZARINA SHUKUR Prasyarat/Pre-requisites: TR33.0 Hasil Pembelajaran/Learning Outcomes Di akhir kursus, pelajar mampu: At the end of the course, students will be able to: i. Menyenaraikan ciri bahasa nalar, bahasa bebas-konteks, dan bahasa lain dalam hirarki Chomsky. List features of regular languages, context free diagrams, and other languages in Chomsky hierarchy. ii. Membina automata untuk mengecam bahasa formal iaitu automata terhingga, push-down automata dan mesin Turing. Develop automata to identify formal languages that are finite automata, push down automata and Turing machine. iii. Menyatakan bahasa formal yang diwakili oleh automata. Explain formal language that is represented by automata. iv. Membuktikan secara formal sifat tutupan bagi setiap bahasa dan menggunakan pumping lemma bagi menafikan ciri sesuatu bahasa. Prove formally the closure property of languages and use pumping lemma to deny properties of language.

2 v. Membincangkan kekuatan dan kelemahan tentang konsep kebolehhitungan. Discuss the advantages and disadvantages of computability concept. vi. Melukis dan menganalisa rajah automata menggunakan perisian JFLAP. Draw and analyze automata diagram by using JFLAP software. 2.0 Sinopsis/Synopsis Kursus ini membincangkan tiga tajuk yang berkait antara satu sama lain iaitu bahasa, mesin dan kebolehitungan. Kursus ini meliputi tajuk seperti berikut: bahasa nalar, automata terhingga untuk mengecam bahasa nalar, bahasa bebas-konteks, push-down automata untuk mengecam bahasa bebas-konteks, mesin Turing dan kepelbagaiannya untuk mengecam bahasa lain dalam hirarki Chomsky, dan had keupayaan algoritma hitungan. Selain itu, pembuktian sifat tutupan bagi suatu bahasa dan penggunaan pumping lemma untuk tujuan mengesahkan ciri sesuatu bahasa juga dibincangkan. Perisian JFLAP bagi melukis dan menganalisa rajah automata digunakan dalam kursus ini. This course will study three mutually related topics: languages, machines, and computability. The course cover the following topics: regular languages, finite automata to identify regular expression, context-free languages, push-down automata to identify context-free languages, Turing machine and its variants to identify other languages in Chomsky hierarchy, and the limit of algorithm for computation. Besides that, the proof of Closure-property for a language, and the use of pumping lemma for verifying properties of language will also be discussed. JFLAP software will be used in this course to draw and analyze automata diagram. 3.0 Rujukan/References Daniel I.A. Cohen, Introduction to Computer Theory 3rd Edition. John Wiley. Hopcroft J.E, Motwani R and Ullman J.D Introduction to Automata Theory, Languages, and Computation (3 rd Edition). Addison Wesley. John C. Martin, Introduction to Languages and the Theory of Computation. McGraw-Hill. Linz, P An Introduction to Formal Language and Automata. Jones & Bartlett Pub. Sipser, M, Introduction to the Theory of Computation. International Thomson Publishing Company. 4.0 Jam Pertemuan/Contact Hours Aktiviti dan Independant Hour (A) Jam Pertemuan (B) Pembelajaran Sendiri (C=AxB) Jumlah jam Pembelajaran (B+C) Kuliah (L)

3 Tutorial (T) Latihan (E) Jumlah Jumlah Jam Pembelajaran 3 Credit Hour 3 kredit (3hour/40hour = 3.425)

4 5.0 Pelaksanaan/Implementations W D Topic Book JFLAP L T E CHAPTER : INTRODUCTION I Sets, Functions, Graphs, and Proof. - Techniques K Background s. K Introduction to languages, grammars, and automata.2.3 Startup 2 CHAPTER 2: FINITE AUTOMATA I Deterministic Finite Automata, Regular Languages K Nondeterministic Finite Automata, Equivalence of DFA and NFA Getting Started with JFLAP Startup K of Deterministic Finite Automata I K Quiz : Finite Automata Quiz -2-2 CHAPTER 3: REGULAR LANGUAGE K Regular Expressions, Equivalence to Regular Languages I of Regular Expressions K Regular Grammars, Equivalence to Regular Languages CHAPTER 4: PROPERTIES FO REGULAR LANGUAGE K Regular Language closure, membership, standard representations I of Regular Languages K Nonregular languages, pumping lemma for regular languages K Quiz 2: Regular Languages Quiz CHAPTER 5: CONTEXT FREE LANGUAGE Context-Free Grammars, Leftmost and Rightmost Derivations, Derivation Trees of Context Free Grammars Context-Free Grammar Parsing, Membership, and Ambiguity of 6. Parsing Context Free Grammars 5.2 for Midterm -5-4, 6., Test -5 8 of Midterm Solutions s Midterm Solutions CHAPTER : PUSHDOWN AUTOMATA Nondeterministic Pushdown Automata Pushdown Automata and Context-Free

5 Languages 9 Deterministic Pushdown Automata and Context-Free Languages.3 5- of Pushdown Automata s Quiz 3: Pushdown Automata 0 CHAPTER 8 Pumping Lemmas for Context-Free Languages and Linear Languages of Pumping Lemmas s 8 5- Quiz 4: Pumping Lemmas -8 Turing Machine and Computability (9-2) Turing Machines, Turing machines as Language Acceptors and Transducers of Turing Machines s Universal Turing Machine and Linear Bounded Automata of Turing Machine 0 Quiz 5: Turing Machine 9-0 Recursive Languages, Recursively.. Enumerable Languages, and Unrestricted Grammars.2 3 Context Sensitive Grammars and the Chomsky Hierarchy of Grammars and Chomsky Hierarchy s Computability, Decidability, Reductions between Undecidable Problems 2. 9 and 4 of Undecidability s 2 Quiz 6: Computability -2 Final Exam Briefing and Course Summary 5 Final Exam 2 TOTAL Penilaian/Evaluations Item Peratus/percentage Class Participation/Quiz/Assignment 40% Mid Test 20% Final Exam 40% Total 00%