바로가기

모두를 위한 열린 강좌 KOCW

주메뉴

강의사진
  • 주제분류
    공학 >컴퓨터ㆍ통신 >소프트웨어공학
  • 강의학기
    2018년 2학기
  • 조회수
    3,573
  •  
강의계획서
강의계획서
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
배속
  • 이전차시
  • 다음차시

차시별 강의

PDF VIDEO SWF AUDIO DOC AX
1. 비디오 Chapter 0. Introduction Automata, Computability, and Complexity URL
2. 비디오 Chapter 1. Regular Languages 1.1 Finite Automata URL
3. 비디오 Chapter 1. Regular Languages 1.1 Finite Automata URL
4. 비디오 Chapter 1. Regular Languages 1.1 Finite Automata URL
5. 비디오 Chapter 1. Regular Languages 1.2 Nondeterminism URL
6. 비디오 Chapter 1. Regular Languages 1.2 Nondeterminism URL
7. 비디오 Chapter 1. Regular Languages 1.3 Regular Expressions URL
8. 비디오 Chapter 1. Regular Languages 1.3 Regular Expressions URL
9. 비디오 Chapter 1. Regular Languages 1.4 Nonregular Languages URL
10. 비디오 Chapter 2. Regular Languages 1.5 Nonregular Languages URL
11. 비디오 Chapter 2. Context-Free Languages 2.1 Context-Free Grammars URL
12. 비디오 Chapter 2. Context-Free Languages 2.1 Context-Free Grammars URL
13. 비디오 Chapter 2. Context-Free Languages 2.2 Pushdown Automata URL
14. 비디오 Chapter 2. Context-Free Languages 2.3 Non-Context-Free Languages URL
15. 비디오 Chapter 2. Context-Free Languages 2.3 Non-Context-Free Languages URL
비디오 Chapter 3. The Church-Turing Thesis 2.4 Deterministic Context-Free Languages URL
비디오 Chapter 3. The Church-Turing Thesis 3.1 Turing Machines URL
비디오 Chapter 3. The Church-Turing Thesis 3.1 Turing Machines URL
비디오 Chapter 3. The Church-Turing Thesis 3.1 Turing Machines URL
비디오 Chapter 3. The Church-Turing Thesis 3.2 Variants of Turing Machines URL
비디오 Chapter 3. The Church-Turing Thesis 3.2 Variants of Turing Machines URL
비디오 Chapter 4. Decidability 4.1 Decidability URL
비디오 Chapter 4. Decidability 4.2 Undecidability (The Halting Problem) URL
비디오 Chapter 4. Decidability 4.2 Undecidability (The Halting Problem) URL

연관 자료

loading..

사용자 의견

강의 평가를 위해서는 로그인 해주세요.