¼ö¾÷½Ã°£ ¹× °ÀǽÇ
- Class A (1179): ¿ù¿äÀÏ 678 (14:00-17:00), Á¾ÇÕ203
- Class B (1180): È¿äÀÏ 123 (09:00-12:00), Á¾ÇÕ411
- Class C (1181): ¼ö¿äÀÏ 123 (09:00-12:00), Á¾ÇÕ306
- Class D (1890): ¸ñ¿äÀÏ 123 (09:00-12:00), Á¾ÇÕ411
Æò°¡
- Ãâ¼®: 20%
- Áß°£°í»ç: 30%
- ±â¸»°í»ç: 30%
- °úÁ¦¹°, Âü¿©µµ ¹× ±âŸ: 20%
±³Àç
- [MS] Introduction to Theory of Computation, Anil Maheshwari and Michiel Smid, Carleton University, 2019
Download free ebook
- [L] Introduction to Formal Languages and Automata, 6th ed., Peter Linz
- [Sip] Introduction to the theory of computation, M. Sipser, PWS Publishing Company, 1997
´ã´ç±³¼ö
- ¹è»ó¿ø
- ¿¬±¸½Ç: 8309
- ÀüÈ: 9677
- ȨÆäÀÌÁö: ¸µÅ©
- À̸ÞÀÏ:
- »ó´ã ȯ¿µ
°øÁö»çÇ×
- (8/23) °øÁö»çÇ×Àº LMS¸¦ Âü°íÇϼ¼¿ä.
- (8/23) °è»êÀÌ·Ð(DD771) ȨÆäÀÌÁö°¡ °³¼³µÇ¾ú½À´Ï´Ù.
°øÁö»çÇ×Àº ¼ö½Ã·Î È®ÀÎÇØÁÖ¼¼¿ä.
°úÁ¦¹°
Á¦Ãâ½Ã ÁÖÀÇ»çÇ×
- Ç¥Áö ¾ø¾îµµ µË´Ï´Ù. ù Àå¿¡ ºÐ¹Ý(¿ù, È, ¼ö, ¸ñ), Çйø, À̸§ ¸í½Ã
- ¼ÕÀ¸·Î ¾²°Å³ª ¿öµåÇÁ·Î¼¼½ºÇϰųª ¾Ë¾Æº¼ ¼ö ÀÖ°Ô
- PDFÆÄÀÏ Çϳª·Î ÀÛ¼º, ÆíÁý ÈÄ LMS¿¡ Á¦Ãâ
- Ç¥Àý Àý´ë ±ÝÁö
°ÀÇÀÚ·á
- ÁÖ±³Àç: [MS] Introduction to Theory of Computation, Anil Maheshwari and Michiel Smid, Carleton University, 2019
±× ¹Û¿¡ µµ¿òÀÌ µÉ ¸¸ÇÑ ÀÚ·á
ÀÏÁ¤
|
°ÀÇ |
°ü·ÃÀÚ·á |
°úÁ¦ |
1ÁÖ (9/2-9/6) |
°ú¸ñ¼Ò°³ |
--- |
--- |
2ÁÖ (9/9-9/13) |
±âº» ¼öÇÐ Áö½Ä |
[MS] Chap. 1, [Sip] Chap. 0 |
HW#1 °Ô½Ã |
3ÁÖ (9/16-9/20) |
Finite Automata and Regular Languages |
[MS] Chap. 2, [Sip] Chap. 1 |
HW#1 Á¦Ãâ |
4ÁÖ (9/23-9/27) |
Finite Automata and Regular Languages |
[MS] Chap. 2, [Sip] Chap. 1 |
HW#2 °Ô½Ã |
5ÁÖ (9/30-10/4) |
Finite Automata and Regular Languages |
[MS] Chap. 2, [Sip] Chap. 1 |
HW#2 Á¦Ãâ HW#3 °Ô½Ã |
6ÁÖ (10/7-10/11) |
Finite Automata and Regular Languages |
[MS] Chap. 2, [Sip] Chap. 1 |
|
7ÁÖ (10/14-10/18) |
Context-Free Languages |
[MS] Chap. 3, [Sip] Chap. 2 |
HW#3 Á¦Ãâ |
8ÁÖ (10/21-10/25) |
Áß°£°í»ç(10/18(±Ý) 17½Ã) ¹× Áß°£°í»ç ¸®ºä |
|
|
9ÁÖ (10/28-11/1) |
Context-Free Languages |
[MS] Chap. 3, [Sip] Chap. 2 |
HW#4 °Ô½Ã |
10ÁÖ (11/4-11/8) |
Context-Free Languages Formal Grammars and Chomsky Hierarchy |
[MS] Chap. 3, [Sip] Chap. 2 |
|
11ÁÖ (11/11-11/15) |
Turing Machines |
[MS] Chap. 4, [Sip] Chap. 3 |
HW#4 Á¦Ãâ HW#5 °Ô½Ã |
12ÁÖ (11/18-11/22) |
Turing Machines |
[MS] Chap. 4, [Sip] Chap. 3 |
HW#5 Á¦Ãâ |
13ÁÖ (11/25-11/29) |
Decidability and Enumerability |
[MS] Chap. 5, [Sip] Chap. 4 |
|
14ÁÖ (12/2-12/6) |
Decidability and Enumerability |
[MS] Chap. 5, [Sip] Chap. 4 |
|
15ÁÖ (12/9-12/13) |
±â¸»°í»ç(12/5(¸ñ) 17½Ã) ¹× ±â¸»°í»ç ¸®ºä |
|
|
ÀÏÁ¤Àº º¯µ¿µÉ ¼ö ÀÖÀ¸¸ç º¯µ¿µÉ °æ¿ì »çÀü¿¡ °øÁöÇÕ´Ï´Ù.
|