Akademik Dersler - İçerik

Recognize regular languages and design finite automata.
Design deterministic and non-deterministic finite automata.
Define properties of regular languages.
Define regular expressions.
Apply the pumping lemma for regular languages.
Explain context-free grammars and languages.
Define context-free grammars and languages.
Apply different grammar forms.
Design a pushdown automata.
Explain the functions of pushdown automata.
Show the equivalence of pushdown automata and context-free grammars.
Explain Turing machines and their properties.
Define Turing machines and explain their diagrams.
Make the algorithmic definition of Turing machines.
List the variants of Turing machines.