2011Çг⵵ ÇкΠ¿¬±¸¿ø ¹× ´ëÇпø ¿¬±¸¿ø(2011³â 1Çбâ)À» ¸ðÁýÇÕ´Ï´Ù.
ÇкΠ¿¬±¸¿øÀÇ °æ¿ì ¼ÒÇÁÆ®¿þ¾î Á¾ÇÕÇÁ·ÎÁ§Æ® °ú¸ñ°ú ¿¬°è°¡ °¡´ÉÇÕ´Ï´Ù.
°è»êÀÌ·Ð ¿¬±¸½ÇÀÇ ¿¬±¸ºÐ¾ß´Â ´ÙÀ½°ú °°½À´Ï´Ù.
ÀÌ·Ð ºÐ¾ß:
Theory of Computation
State Complexity for Regular Languages
Prime Decomposition for Regular Languages
Coding Theory, Cellular Automata
Parallel Algorithms for Automata
ÀÀ¿ë ºÐ¾ß:
Regular-Expression °Ë»ö ½Ã½ºÅÛ (ÅØ½ºÆ®, ¸ÖƼ¹Ìµð¾î)
°³ÀÎÈµÈ Media Contents °Ë»ö ¹× Ãßõ ½Ã½ºÅÛ
¼Ò¼È ³×Æ®¿öÅ©³» »ç¿ëÀÚ ¸í¼º(user reputation) Æò°¡ ±â¹ý °³¹ß
°ü½ÉÀÖÀ¸½Å ºÐÀº ¾Æ·¡ ¿¬¶ôó·Î ¿¬¶ôÇϽðí ã¾Æ¿À±â ¹Ù¶ø´Ï´Ù.
Çѿ伷: 02-2123-5725 (C518-AÈ£)
À̸ÞÀÏ: emmous [at] cs [dot] yonsei [dot] ac [dot] kr