Our lab investigates formal languages and automata theory. The theory of computation is the branch of computer science and mathematics that deals with

whether or not a problem can be solved [computability]

how a problem can be solved [complexity]

using algorithms.

We are mainly interested in

• examining structural properties of various models of computations such as finite-state automata or pushdown automata
• designing efficient algorithms for practical problems and establishing its correctness
• developing applications based on automata theory for
  • information retrieval
  • NLP
  • Code LLMs