컴퓨테이션이론
- 건국대학교
- 남원홍
페이스북
트위터
카카오톡
네이버밴드
링크복사
-
- 주제분류
- 공학 >컴퓨터ㆍ통신 >컴퓨터과학
-
- 강의학기
- 2017년 2학기
-
- 조회수
- 5,811
-
- 강의계획서
- 강의계획서
To understand computation, this course offers an introduction to the science behind computing by studying computation abstractly without worrying about specifics of programming languages and/or computing platforms. In particular, we will study (a) finite automata that capture what can be computed using constant memory, and define the class of regular languages useful for pattern matching languages; (b) the universal computational model of Turing machines, and the inherent limits of what can be solved on a computer (undecidability)
- 수강안내 및 수강신청
- ※ 수강확인증 발급을 위해서는 수강신청이 필요합니다
Chapter 0. Introduction
차시별 강의
| 1. | |
Chapter 0. Introduction | Automata, Computability, and Complexity |  |
| 2. | |
Chapter 1. Regular Languages | 1.1 Finite Automata | |
| 3. | |
Chapter 1. Regular Languages | 1.2 Nondeterminism | |
| 4. | |
Chapter 1. Regular Languages | 1.2 Nondeterminism | |
| 5. | |
Chapter 1. Regular Languages | 1.3 Regular Expressions | |
| 6. | |
Chapter 1. Regular Languages | 1.3 Regular Expressions | |
| 7. | |
Chapter 1. Regular Languages | 1.3 Regular Expressions | |
| 8. | |
Chapter 1. Regular Languages | 1.3 Regular Expressions | |
| 9. | |
Chapter 1. Regular Languages | 1.3 Regular Expressions(Example) | |
| 10. | |
Chapter 1. Regular Languages | 1.3 Regular Expressions(Example) | |
| 11. | |
Chapter 1. Regular Languages | 1.3 Regular Expressions(Example) | |
| 12. | |
Chapter 2. Context Free Languages | 2.1 Context-Free Grammars | |
| 13. | |
Chapter 2. Context Free Languages | 2.1 Context-Free Grammars, 2.2 Pushdown Automata | |
| 14. | |
Chapter 2. Context Free Languages | 2.2 Pushdown Automata | |
| 15. | |
Chapter 2. Context Free Languages | 2.3 Non-Context-Free Languages | |
|
Chapter 2. Context Free Languages | 2.3 Non-Context-Free Languages | |
|
|
Chapter 2. Context Free Languages | 2.4 Deterministic Context-Free Languages | |
|
|
Chapter 3. The Church Turing Thesis | 3.1 Turing Machines | |
|
|
Chapter 3. The Church Turing Thesis | 3.1 Turing Machines | |
|
|
Chapter 3. The Church Turing Thesis | 3.2 Variants of Turing Machines | |
|
|
Chapter 3. The Church Turing Thesis | 3.2 Variants of Turing Machines, 3.3 The Definition of Algorithm | |
|
|
Chapter 4. Decidability | 4.1 Decidability | |
|
|
Chapter 4. Decidability | 4.1 Decidability | |
|
|
Chapter 4. Decidability | 4.2 Undecidability | |
연관 자료
