Teori Bahasa dan Otomata
Tugas Membuat Video
Tugas 1 Theory of Computation
- Introduction to Theory of Computation
- TOC – Conclusion and Summary
- Regular Languages
- Operations on Regular Languages
- Regular Languages & Finite Automata (Solved Problem 1)
- Regular Languages & Finite Automata (Solved Problem 2)
- Regular Languages & Finite Automata (Solved Problem 3)
- Regular Languages & Finite Automata (Solved Problem 4)
- Regular Languages & Finite Automata (Solved Problem 5)
- Regular Languages & Finite Automata (Solved Problem 6)
- Method to find whether a string belong to a Grammar or not
Tugas 2 Finite State Machines
- Finite State Machine (Prerequisites)
- Finite State Machine (Finite Automata)
Deterministic Finite Automata
- Deterministic Finite Automata (Example -1)
- Deterministic Finite Automata (Example -2)
- Deterministic Finite Automata (Example -3)
- Deterministic Finite Automata (Example -4)
- Equivalence of two Finite Automata
- Equivalence of two Finite Automata (Example)
Non-deterministic Finite Automata
- Formal definition of NFA
- NFA Examples (Part 1)
- NFA Examples (Part 2)
- NFA Examples (Part 3)
Tugas 3
- Minimization of DFA
- Minimization of DFA - Examples (Part 1)
- Minimization of DFA - Examples (Part 2)
- Minimization of DFA (Multiple Final States)
- Minimization of DFA (When there are Unreachable States)
- Minimization of DFA - Table Filling Method (Myhill-Nerode Theorem)
- Minimization of DFA - Table Filling Method (Example)
Tugas 4 Conversion of NFA to DFA and their equivalence
- Conversion of NFA to DFA
- Conversion of NFA to DFA - Examples (Part 1)
- Conversion of NFA to DFA - Examples (Part 2)
- Conversion of NFA to DFA - Examples (Part 3)
- Conversion of NFA to DFA - Examples (Part 4)
Tugas 5
- Epsilon NFA
- Conversion of Epsilon NFA to NFA
- Conversion of Epsilon NFA to NFA - Examples (Part 1)
- 07:20 Conversion of Epsilon NFA to NFA - Examples (Part 2)
Tugas 6 Mealy Machine and Moore Machine
- Finite Automata With Outputs
- 09:14 Construction of Mealy Machine
- 06:31 Construction of Mealy Machine - Examples (Part 1)
- 09:12 Construction of Mealy Machine - Examples (Part 2)
- 08:52 Construction of Moore Machine
- 09:39 Construction of Moore Machine - Examples (Part 1)
- 06:25 Construction of Moore Machine - Examples (Part 2)
- 06:41 Conversion of Moore Machine to Mealy Machine
- 06:16 Conversion of Moore Machine to Mealy Machine - Examples (Part 1)
- 06:37 Conversion of Moore Machine to Mealy Machine - Examples (Part 2)
- 10:30 Conversion of Mealy Machine to Moore Machine
- 11:16 Conversion of Mealy Machine to Moore Machine - Examples (Part 1)
- 9:45 Conversion of Mealy Machine to Moore Machine - Examples (Part 2)
- 8:45 Conversion of Mealy Machine to Moore Machine (Using Transition Table)
Tugas 7
Regular Expression
- 4:43 Regular Expression
- 5:32 Regular Expression - Examples
- 6:44 Identities of Regular Expression
- 5:49 An Example Proof using Identities of Regular Expressions
- 6:55 Designing Regular Expressions
- 13:37 NFA to Regular Expression Conversion
Tugas 8
- 6:19 DFA to Regular Expression Conversion
- 8:27 DFA to Regular Expression Conversion (when the DFA has Multiple Final States)
- 4:27 Conversion of Regular Expression to Finite Automata
- 8:54 Conversion of Regular Expression to Finite Automata - Examples (Part 1)
- 6:20 Conversion of Regular Expression to Finite Automata - Examples (Part 2)
- 6:48 Conversion of Regular Expression to Finite Automata - Examples (Part 3) tambahan 8:08 Pumping Lemma (For Regular Languages) 14:16 Pumping Lemma (For Regular Languages) | Example 1 8:38 Pumping Lemma (For Regular Languages) | Example 2 7:35 Arden’s Theorem 10:14 Regular Grammar 9:49 Derivations from a Grammar
Tugas 9
Context Free Languages
- 7:52 Context Free Grammar & Context Free Language
- 12:33 Derivation Tree (Left & Right Derivation Trees)
- 5:44 Ambiguous Grammar
Tugas 10
- 13:57 Simplification of CFG (Reduction of CFG)
- 8:36 Simplification of CFG (Removal of Unit Productions)
- 8:31 Simplification of CFG (Removal of Null Productions)
Tugas 11
- 6:38 Chomsky Normal Form & CFG to CNF Conversion
- 12:58 Conversion of CFG to Chomsky Normal Form
- 13:17 Greibach Normal Form & CFG to GNF Conversion
- 11:20 CFG to GNF Conversion (Removal of Left Recursion)
tambahan
8:06 Pumping Lemma (For Context Free Languages)
12:22 Pumping Lemma (For Context Free Languages) - Examples (Part 1)
17:44 Pumping Lemma (For Context Free Languages) - Examples (Part 2)
Tugas 12
- 7:07 Pushdown Automata (Introduction)
- 9:16 Pushdown Automata (Formal Definition)
- 12:12 Pushdown Automata (Graphical Notation)
- 14:11 Pushdown Automata Example (Even Palindrome) PART-1
- 19:19 Pushdown Automata Example (Even Palindrome) PART-2
- 13:49 Pushdown Automata Example (Even Palindrome) PART-3
Tugas 13
- 22:49 Equivalence of CFG and PDA (Part 1)
- 21:47 Equivalence of CFG and PDA (Part 2a)
- 19:33 Equivalence of CFG and PDA (Part 2b)
Tugas 14
Turing Machine
- 8:05 Turing Machine - Introduction (Part 1)
- 9:53 Turing Machine - Introduction (Part 2)
- 9:38 Turing Machine (Formal Definition)
- 10:35 Turing Machine (Example-1)
- 13:51 Turing Machine (Example-2)
- 15:49 Turing Machine for Even Palindromes
tambahan
11:28 Turing Machine Programming Techniques (Part-1)
9:39 Turing Machine Programming Techniques (Part-2)
7:57 Turing Machine Programming Techniques (Part-3)
17:33 Multitape Turing Machine
15:49 Nondeterministic Turing Machine (Part 1)
13:58 Nondeterministic Turing Machine (Part 2)
12:04 Turing Machine as Problem Solvers
13:25 The Church-Turing Thesis
tambahan
Undecidability
7:42 Decidability and Undecidability
8:20 Universal Turing Machine
7:26 The Halting Problem
8:00 Undecidability of the Halting Problem
14:29 The Post Correspondence Problem
27:46 Undecidability of the Post Correspondence Problem
sumber
- silabus https://web.facebook.com/groups/IK737/learning_content/?filter=455255808442474&post=525048841670160
- utama video https://www.youtube.com/playlist?list=PLBlnK6fEyqRgp46KUv4ZY69yXmpwKOIev
- tambahan, cari secara mandiri.