• examining structural properties of various models of computations such as finite-state automata or pushdown automata
• designing efficient algorithms for those computation models (FAs, PDAs or Turing Machines)
• developing applications based on automata theory
  • fast regular-expression searching engine
  • pattern matching
  • information retrieval
  • data similarity

Recruitment in our lab [click for more info in Korean]
We are looking for excellent PhD and master students to develop our lab. We target at training students to publish papers in top international conferences and journals. Our research focuses on very interesting formal language and automata theory problems as summarized in here. Students are invited to get involved in the ongoing projects; and they are also highly encouraged to propose and investigate brand-new problems that they find interesting. Members in our lab would have opportunities to attend top conferences and to visit foreign labs in the related research field.
We are also offering an internship program to undergraduate students (who want to know more about theoretical computer science) at any time.
Any students who are interested in our lab, please email us.