¼ö¾÷½Ã°£ ¹× °ÀǽÇ
- Class A (1164): ¼ö¿äÀÏ 678 (14:00-17:00), Á¾ÇÕ206
- Class B (1165): ¸ñ¿äÀÏ 123 (09:00-12:00), Á¾ÇÕ307
- Class C (1166): ±Ý¿äÀÏ 123 (09:00-12:00), Á¦2°øÇаü203
Æò°¡
- Ãâ¼®: 20%
- Áß°£°í»ç: 30%
- ±â¸»°í»ç: 30%
- °úÁ¦¹°, Âü¿©µµ ¹× ±âŸ: 20%
±³Àç
- [MS] Introduction to Theory of Computation, Anil Maheshwari and Michiel Smid, Carleton University, 2024
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/27) °øÁö»çÇ×Àº LMS¸¦ Âü°íÇϼ¼¿ä.
- (8/27) Áß°£°í»ç ¹× ±â¸»°í»ç ³¯Â¥¸¦ ²À ±â¾ïÇϼ¼¿ä.
- (8/27) ¿ÀÅ丶Ÿ¿Í°è»êÀÌ·Ð(DD851) ȨÆäÀÌÁö°¡ °³¼³µÇ¾ú½À´Ï´Ù.
°øÁö»çÇ×Àº ¼ö½Ã·Î È®ÀÎÇØÁÖ¼¼¿ä.
°úÁ¦¹°
Á¦Ãâ½Ã ÁÖÀÇ»çÇ×
- Ç¥Áö ¾ø¾îµµ µË´Ï´Ù. ù Àå¿¡ ºÐ¹Ý(¼ö, ¸ñ, ±Ý), Çйø, À̸§ ¸í½Ã
- PDFÆÄÀÏ Çϳª·Î ÀÛ¼º, ÆíÁý ÈÄ LMS¿¡ Á¦Ãâ
- Ç¥Àý Àý´ë ±ÝÁö
°ÀÇÀÚ·á
- ÁÖ±³Àç: [MS] Introduction to Theory of Computation, Anil Maheshwari and Michiel Smid, Carleton University, 2024
±× ¹Û¿¡ µµ¿òÀÌ µÉ ¸¸ÇÑ ÀÚ·á
ÀÏÁ¤
| |
°ÀÇ |
°ü·ÃÀÚ·á |
°úÁ¦ |
| 1ÁÖ (9/2-9/4) |
°ú¸ñ¼Ò°³ |
--- |
--- |
| 2ÁÖ (9/9-9/11) |
±âº» ¼öÇÐ Áö½Ä |
[MS] Chap. 1, [Sip] Chap. 0 |
HW#1 °Ô½Ã |
| 3ÁÖ (9/16-9/18) |
Finite Automata and Regular Languages |
[MS] Chap. 2, [Sip] Chap. 1 |
HW#1 Á¦Ãâ |
| 4ÁÖ (9/23-9/25) |
Finite Automata and Regular Languages |
[MS] Chap. 2, [Sip] Chap. 1 |
HW#2 °Ô½Ã |
| 5ÁÖ (9/30-10/2) |
Finite Automata and Regular Languages |
[MS] Chap. 2, [Sip] Chap. 1 |
HW#2 Á¦Ãâ HW#3 °Ô½Ã |
| 6ÁÖ (10/7-10/9) |
Finite Automata and Regular Languages |
[MS] Chap. 2, [Sip] Chap. 1 |
|
| 7ÁÖ (10/14-10/16) |
Context-Free Languages |
[MS] Chap. 3, [Sip] Chap. 2 |
HW#3 Á¦Ãâ |
| 8ÁÖ (10/21-10/23) |
Áß°£°í»ç(10/19(¿ù) 17½Ã) ¹× Áß°£°í»ç ¸®ºä |
|
|
| 9ÁÖ (10/28-10/30) |
Context-Free Languages |
[MS] Chap. 3, [Sip] Chap. 2 |
HW#4 °Ô½Ã |
| 10ÁÖ (11/4-11/6) |
Context-Free Languages Formal Grammars and Chomsky Hierarchy |
[MS] Chap. 3, [Sip] Chap. 2 |
|
| 11ÁÖ (11/11-11/13) |
Turing Machines |
[MS] Chap. 4, [Sip] Chap. 3 |
HW#4 Á¦Ãâ HW#5 °Ô½Ã |
| 12ÁÖ (11/18-11/20) |
Turing Machines |
[MS] Chap. 4, [Sip] Chap. 3 |
HW#5 Á¦Ãâ |
| 13ÁÖ (11/25-11/27) |
Decidability and Enumerability |
[MS] Chap. 5, [Sip] Chap. 4 |
|
| 14ÁÖ (12/2-12/4) |
Decidability and Enumerability |
[MS] Chap. 5, [Sip] Chap. 4 |
|
| 15ÁÖ (12/9-12/11) |
±â¸»°í»ç(12/7(¿ù) 17½Ã) ¹× ±â¸»°í»ç ¸®ºä |
|
|
ÀÏÁ¤Àº º¯µ¿µÉ ¼ö ÀÖÀ¸¸ç º¯µ¿µÉ °æ¿ì »çÀü¿¡ °øÁöÇÕ´Ï´Ù.
|