-
- 주제분류
- 공학 >컴퓨터ㆍ통신 >컴퓨터공학
-
- 강의학기
- 2014년 2학기
-
- 조회수
- 15,570
-
- 평점
- 5/5.0 (1)
To understand computation for internet or multimedia. This course offers an introduction to the science behind computing by studying computation abstractly wihtout worrying about specifics of programming languages and/or computing platforms. In particular, wh will study (a) finite automata that capture what can be computed using constant memory, and define the class of regular languages usefyl for pattern matching languages: (b) the universal computational model of Turing machines, and the inherent limis of what can be solved on a computer(undecidability).
- 수강안내 및 수강신청
- ※ 수강확인증 발급을 위해서는 수강신청이 필요합니다
차시별 강의
| 1. | ![]() |
Chapter 1. Regular Languages | 1.1 Finite Automata/ 1.2 Nondeterminism | |
| 2. | ![]() |
Chapter 1. Regular Languages | 1.1 Finite Automata/ 1.2 Nondeterminism | |
| 3. | ![]() |
Chapter 1. Regular Languages | 1.1 Finite Automata/ 1.2 Nondeterminism | |
| 4. | ![]() |
Chapter 1. Regular Languages | 1.3 Regular Expressions/ 1.4 Nonregular Languages | |
| 5. | ![]() |
Chapter 1. Regular Languages | 1.3 Regular Expressions/ 1.4 Nonregular Languages | |
| 6. | ![]() |
Chapter 1. Regular Languages | 1.3 Regular Expressions/ 1.4 Nonregular Languages | |
| 7. | ![]() |
Chapter 1. Regular Languages | 1.3 Regular Expressions/ 1.4 Nonregular Languages | |
| 8. | ![]() |
Chapter 2. Context-Free Languages | 2.1 Context-Free Grammars | |
| 9. | ![]() |
Chapter 2. Context-Free Languages | 2.1 Context-Free Grammars | |
| 10. | ![]() |
Chapter 2. Context-Free Languages | 2.2 Pushdown Automata | |
| 11. | ![]() |
Chapter 2. Context-Free Languages | 2.2 Pushdown Automata | |
| 12. | ![]() |
Chapter 2. Context-Free Languages | 2.3 Non-Context-Free Languages | |
| 13. | ![]() |
Chapter 2. Context-Free Languages | 2.4 Deterministic Context-Free Languages | |
| 14. | ![]() |
Chapter 3. The Church-Turing Thesis | 3.1 Turing Machines | |
| 15. | ![]() |
Chapter 3. The Church-Turing Thesis | 3.2 Variants of Turing Machines | |
![]() |
Chapter 3. The Church-Turing Thesis | 3.3 The Definition of Algorithm | |
|
![]() |
Chapter 3. The Church-Turing Thesis | 3.2 Variants of Turing Machines | |
|
![]() |
Chapter 3. The Church-Turing Thesis/ Chapter 4. Decidability | 3.3 The Definition of Algorithm/4.1 Decidability | |
|
![]() |
Chapter 4. Decidability | 4.1 Decidability | |
|
![]() |
Chapter 4. Decidability | 4.1 Decidability | |
|
![]() |
Chapter 4. Decidability | 4.2 Undecidability (The Halting problem) | |
|
![]() |
Chapter 4. Decidability | 4.2 Undecidability (The Halting problem) | |
|
![]() |
Chapter 4. Decidability | 4.2 Undecidability (The Halting problem) | |
연관 자료










