Pilih silabus pada checkbox atau tulis pada form
Body
jika ada silabus yang ingin ditambahkan
Title
Silabus
Grammar, language, automata (strings and languages, some basic terms, basic language operations, grammar, grammar equivalent, Chomsky Hierarchy of Grammars, automata).
Finite Automata (description, deterministic finite automata (DFA), Transition Graph, language and DFA, regular language, non-deterministic finite automata (NFA), NFA languages, epsilon-NFA, DFA and NFA equivalents, conversion from NFA to DFA ).
Regular and regular grammar languages
Context-free grammars (description, leftmost derivation and rightmost derivation, derivation trees, partial derivation trees, parsing, ambiguity, simple grammar, simplification of CFG, substitution rules).
Pushdown automaton
Turing machine and computability
Computability (computability, computability relation with Turing machine, undecidability, recursive language, enumerable recursive language, non-recursive language, non-recursively enumerable language).
Body (tulis apabila ada silabus yang ingin ditambahkan)
Pilih durasi video dan tanggal publikasi video (opsional)
Pilih durasi video:
Any (durasi video bebas)
Long (lebih dari 20 menit)
Medium (antara 4 dan 20 menit)
Short (kurang dari 4 menit)
Tanggal publikasi (menampilkan video sebelum tanggal publikasi):