컴퓨테이션이론

건국대학교
남원홍

페이스북 트위터 카카오톡 네이버밴드 링크복사

주제분류

공학 >컴퓨터ㆍ통신 >소프트웨어공학
강의학기

2018년 2학기

조회수

3,753

강의계획서

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.1 Finite Automata
4.	Chapter 1. Regular Languages	1.1 Finite Automata
5.	Chapter 1. Regular Languages	1.2 Nondeterminism
6.	Chapter 1. Regular Languages	1.2 Nondeterminism
7.	Chapter 1. Regular Languages	1.3 Regular Expressions
8.	Chapter 1. Regular Languages	1.3 Regular Expressions
9.	Chapter 1. Regular Languages	1.4 Nonregular Languages
10.	Chapter 2. Regular Languages	1.5 Nonregular Languages
11.	Chapter 2. Context-Free Languages	2.1 Context-Free Grammars
12.	Chapter 2. Context-Free Languages	2.1 Context-Free Grammars
13.	Chapter 2. Context-Free Languages	2.2 Pushdown Automata
14.	Chapter 2. Context-Free Languages	2.3 Non-Context-Free Languages
15.	Chapter 2. Context-Free Languages	2.3 Non-Context-Free Languages
	Chapter 3. The Church-Turing Thesis	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.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
	Chapter 4. Decidability	4.1 Decidability
	Chapter 4. Decidability	4.2 Undecidability (The Halting Problem)
	Chapter 4. Decidability	4.2 Undecidability (The Halting Problem)