Teori Bahasa dan Otomata - Tugas Membuat Video
- Introduction to Theory of Computation
- TOC – Conclusion and Summary
- Regular Languages
- Operations on Regular Languages
- Regular Languages & Finite Automata (Solved Problem 1 s.d. 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 s.d. 4)
- Equivalence of two Finite Automata
- Equivalence of two Finite Automata (Example)
Non-deterministic Finite Automata
- Formal definition of NFA
- NFA Examples (Part 1, 2, 3)
Tugas 3 Minimization of DFA
- Minimization of DFA - Examples (Part 1 & 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 s.d. 4)
Tugas 5 Epsilon NFA
- Conversion of Epsilon NFA to NFA
- Conversion of Epsilon NFA to NFA - Examples (Part 1 & 2)
Tugas 6 Regular Expression
- Regular Expression
- Regular Expression - Examples
- Identities of Regular Expression
- An Example Proof using Identities of Regular Expressions
- Designing Regular Expressions
- NFA to Regular Expression Conversion
Tugas 7 DFA to Regular Expression Conversion
- DFA to Regular Expression Conversion (when the DFA has Multiple Final States)
- Conversion of Regular Expression to Finite Automata
- Conversion of Regular Expression to Finite Automata - Examples (Part 1, 2, 3)
- tambahan 8:08 Pumping Lemma (For Regular Languages)
- Pumping Lemma (For Regular Languages) | Example 1 & 2
- Arden’s Theorem
Kuis 1 Finite Automata With Outputs
- Mealy Machine and Moore Machine
- Construction of Mealy Machine
- Construction of Mealy Machine - Examples (Part 1 & 2)
- Construction of Moore Machine
- Construction of Moore Machine - Examples (Part 1 & 2)
- Conversion of Moore Machine to Mealy Machine
- Conversion of Moore Machine to Mealy Machine - Examples (Part 1 & 2)
- Conversion of Mealy Machine to Moore Machine
- Conversion of Mealy Machine to Moore Machine - Examples (Part 1 & 2)
- Conversion of Mealy Machine to Moore Machine (Using Transition Table)
Kuis 2 Grammar
- Regular Grammar
- Context Free Languages
- Context Free Grammar & Context Free Language
Kuis 3 Regular Grammar & FSA
- Conversion of Regular Grammar to FSA
- Conversion of FSA to Regular Grammar
Kuis 4 Derivation Tree
- Derivations from a Grammar
- Left & Right Derivation Trees
- Ambiguous Grammar
Kuis 5 Simplification of CFG (Reduction of CFG)
- Simplification of CFG (Removal of Unit Productions)
- Simplification of CFG (Removal of Null Productions)
- Chomsky Normal Form & CFG to CNF Conversion
- Conversion of CFG to Chomsky Normal Form
- Greibach Normal Form & CFG to GNF Conversion
- CFG to GNF Conversion (Removal of Left Recursion)
tambahan
Pumping Lemma (For Context Free Languages)
Pumping Lemma (For Context Free Languages) - Examples (Part 1 & 2)
Kuis 6 Pushdown Automata (Introduction)
- Pushdown Automata (Formal Definition)
- Pushdown Automata (Graphical Notation)
- Pushdown Automata Example (Even Palindrome) PART 1, 2, 3
- Equivalence of CFG and PDA (Part 1 & 2)
Kuis 7 Turing Machine
- Turing Machine - Introduction (Part 1 & 2)
- Turing Machine (Formal Definition)
- Turing Machine (Example-1 & 2)
- Turing Machine for Even Palindromes
tambahan
Turing Machine Programming Techniques (Part 1, 2, 3)
Multitape Turing Machine
Nondeterministic Turing Machine (Part 1 & 2)
Turing Machine as Problem Solvers
The Church-Turing Thesis
tambahan
Undecidability
Decidability and Undecidability
Universal Turing Machine
The Halting Problem
Undecidability of the Halting Problem
The Post Correspondence Problem
Undecidability of the Post Correspondence Problem