>
Course Unit Title | Course Unit Code | Type of Course Unit | Level of Course Unit | Year of Study | Semester | ECTS Credits |
---|---|---|---|---|---|---|
Automata Theory | YZM208 | Compulsory | Bachelor's degree | 2 | Spring | 4 |
Assistant Prof. Dr. Kaplan KAPLAN
Lecturer Onur GÖK
1) Explain the importance of computer theory that constitutes the core of software and hardware systems.
2) Defines the concrete applications of basic models of computer theory in computer science.
3) Defines the theoretical basis of sequential circuits involved in digital logic design.
4) Reflects the ability to think abstractly
5) Express concepts and solutions formally
Program Competencies | |||||||||||||
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | ||
Learning Outcomes | |||||||||||||
1 | High | Low | Low | Middle | No relation | No relation | Low | Middle | Low | No relation | Low | No relation | |
2 | High | Low | Low | Middle | No relation | No relation | No relation | Middle | Low | No relation | Middle | No relation | |
3 | High | Middle | Low | Low | No relation | No relation | No relation | Low | High | No relation | Middle | No relation | |
4 | Middle | Middle | Low | Low | No relation | No relation | No relation | Low | No relation | No relation | High | No relation | |
5 | Middle | Low | Low | Low | No relation | No relation | No relation | Low | No relation | No relation | High | No relation |
Face to Face
None
Not Required
Mathematical concepts, alphabets and languages, regular languages and finite automata, Features of languages independent of content, Push down automat, Introduction to Turing machines, Overlaps between grammars and automata, Undecided problems, Difficult problems
Turkish
Not Required