I am a postdoctoral researcher in the Theoretical Computer Science Group at the University of Göttingen. I am currently working with professor Florin Manea on string algorithms and pattern matching. I received my PhD in Computer Science at Yonsei University, South Korea, under the supervision of professor Yo-Sub Han.

Research Interests

My main research interest lies in (but not confined to) solving algorithmic problems for strings and finite state machines. On the one hand, I am interested in designing efficient algorithms for pattern matching problems under various string equivalences, such as the Simon’s congruence. On the other hand, I am also interested in decidability problems for strings and formal languages.

News

• [July 2026] The journal paper “Pattern mining under Simon’s congruence” has been accepted for publication in Information and Computation!
• [May 2026] Two papers “Decomposing regular languages under shuffle along trajectories” and “Pattern matching under R-congruence” have been accepted for CIAA 2026!
• [Mar. 2026] The journal paper “Matching Patterns with Variables under Simon’s Congruence” is accepted for publication in JALC!
• [Nov. 2025] The journal paper “Approximate Cartesian Tree Pattern Matching” is published in Theoretical Computer Science!
• [Sep. 2025] The journal paper “Existential and Universal Width of Alternating Finite Automata” is published in Information and Computation!

Personal

• Feb. 2026: I hit a 1000 day streak on Duolingo!
• I am a punny guy but these Korean jokes don’t translate to English very well.

Last updated: 2026 October