DD851 ¿ÀÅ丶Ÿ¿Í°è»êÀÌ·Ð, DD771 °è»êÀÌ·Ð

2025³â 2Çбâ
°æ±â´ëÇб³ AIÄÄÇ»ÅͰøÇкÎ


°øÁö»çÇ×Àº ¼ö½Ã·Î üũ! | °úÁ¦¹°, °­ÀÇÀÚ·á | ÀÏÁ¤

¼ö¾÷½Ã°£ ¹× °­ÀǽÇ

  • Class A (1218): ¿ù¿äÀÏ 678 (14:00-17:00), Á¾ÇÕ512
  • Class B (1219): È­¿äÀÏ 123 (09:00-12:00), 2°ø203
  • Class C (1258): ¼ö¿äÀÏ 123 (09:00-12:00), Á¾ÇÕ207

Æò°¡

  • Ãâ¼®: 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/24) °øÁö»çÇ×Àº LMS¸¦ Âü°íÇϼ¼¿ä.
  • (8/24) Áß°£°í»ç ¹× ±â¸»°í»ç ³¯Â¥¸¦ ²À ±â¾ïÇϼ¼¿ä.
  • (8/24) ¿ÀÅ丶Ÿ¿Í°è»êÀÌ·Ð(DD851)°ú °è»êÀÌ·Ð(DD771)Àº ¿ÏÀüÈ÷ °°Àº ³»¿ëÀ» ´Ù·ì´Ï´Ù.
  • (8/24) ¿ÀÅ丶Ÿ¿Í°è»êÀÌ·Ð(DD851) ¹× °è»êÀÌ·Ð(DD771) ȨÆäÀÌÁö°¡ °³¼³µÇ¾ú½À´Ï´Ù.
°øÁö»çÇ×Àº ¼ö½Ã·Î È®ÀÎÇØÁÖ¼¼¿ä.

°úÁ¦¹°

Á¦Ãâ½Ã ÁÖÀÇ»çÇ×
- Ç¥Áö ¾ø¾îµµ µË´Ï´Ù. ù Àå¿¡ ºÐ¹Ý(¿ù, È­, ¼ö, ¸ñ), Çйø, À̸§ ¸í½Ã
- ¼ÕÀ¸·Î ¾²°Å³ª ¿öµåÇÁ·Î¼¼½ºÇϰųª ¾Ë¾Æº¼ ¼ö ÀÖ°Ô
- PDFÆÄÀÏ Çϳª·Î ÀÛ¼º, ÆíÁý ÈÄ LMS¿¡ Á¦Ãâ
- Ç¥Àý Àý´ë ±ÝÁö

°­ÀÇÀÚ·á

  1. ÁÖ±³Àç: [MS] Introduction to Theory of Computation, Anil Maheshwari and Michiel Smid, Carleton University, 2024

±× ¹Û¿¡ µµ¿òÀÌ µÉ ¸¸ÇÑ ÀÚ·á


ÀÏÁ¤

°­ÀÇ °ü·ÃÀÚ·á °úÁ¦
1ÁÖ (9/1-9/5) °ú¸ñ¼Ò°³ --- ---
2ÁÖ (9/8-9/12) ±âº» ¼öÇÐ Áö½Ä [MS] Chap. 1, [Sip] Chap. 0 HW#1 °Ô½Ã
3ÁÖ (9/15-9/19) Finite Automata and Regular Languages [MS] Chap. 2, [Sip] Chap. 1 HW#1 Á¦Ãâ
4ÁÖ (9/22-9/26) Finite Automata and Regular Languages [MS] Chap. 2, [Sip] Chap. 1 HW#2 °Ô½Ã
5ÁÖ (9/23-10/3) Finite Automata and Regular Languages [MS] Chap. 2, [Sip] Chap. 1 HW#2 Á¦Ãâ
HW#3 °Ô½Ã
6ÁÖ (10/6-10/10) Finite Automata and Regular Languages [MS] Chap. 2, [Sip] Chap. 1
7ÁÖ (10/13-10/17) Context-Free Languages [MS] Chap. 3, [Sip] Chap. 2 HW#3 Á¦Ãâ
8ÁÖ (10/20-10/24) Áß°£°í»ç(10/17(±Ý) 17½Ã) ¹× Áß°£°í»ç ¸®ºä
9ÁÖ (10/27-10/31) Context-Free Languages [MS] Chap. 3, [Sip] Chap. 2 HW#4 °Ô½Ã
10ÁÖ (11/3-11/7) Context-Free Languages
Formal Grammars and Chomsky Hierarchy
[MS] Chap. 3, [Sip] Chap. 2
11ÁÖ (11/10-11/14) Turing Machines [MS] Chap. 4, [Sip] Chap. 3 HW#4 Á¦Ãâ
HW#5 °Ô½Ã
12ÁÖ (11/17-11/21) Turing Machines [MS] Chap. 4, [Sip] Chap. 3 HW#5 Á¦Ãâ
13ÁÖ (11/24-11/28) Decidability and Enumerability [MS] Chap. 5, [Sip] Chap. 4
14ÁÖ (12/1-12/5) Decidability and Enumerability [MS] Chap. 5, [Sip] Chap. 4
15ÁÖ (12/9-12/13) ±â¸»°í»ç(12/5(±Ý) 17½Ã) ¹× ±â¸»°í»ç ¸®ºä

ÀÏÁ¤Àº º¯µ¿µÉ ¼ö ÀÖÀ¸¸ç º¯µ¿µÉ °æ¿ì »çÀü¿¡ °øÁöÇÕ´Ï´Ù.


°øÁö»çÇ×Àº ¼ö½Ã·Î üũ! | °úÁ¦¹°, °­ÀÇÀÚ·á | ÀÏÁ¤



Managed by Sang Won Bae
Professor
Div. AI Computer Science and Engineering, Kyonggi University
Suwon, Korea.