Akademik Dersler - İçerik

Defines machine models formally.
Defines finite automata.
Defines regular languages.
Defines turing machines.
Synthesizes finite automata with specific properties.
Applies transformation between multiple representations of finite automata.
Explains the difference between deterministic finite automata and non deterministic finite automata.
Explains the relationship between deterministic finite automata and regular languages.
Proves the undecidability or complexity of a variety of problems
Uses pigeon-holing arguments and closure properties to prove particular problems cannot be solved by finite automata.
Illustrates concrete examples of undecidable problems from different fields.
Defines and explains the significance of the "P = NP?" question and NP-completeness.
Illustrates concrete examples of decidable problems that are known to be unsolvable in polynomial time.