Publications

Click on each paper to see a detailed description. Selected publications are marked with a star.

Selected Publications

Approximate Cartesian tree pattern matching,
Sungmin Kim and Yo-Sub Han
In Theoretical Computer Science , Vol. 1056, p. 115506, November 2025 [paper]
Existential and universal width of alternating finite automata,
Yo-Sub Han, Sungmin Kim, Sang-Ki Ko and Kai Salomaa
In Information and Computation , Vol. 306, p. 105337, August 2025 [paper]
Simon's congruence pattern matching,
Sungmin Kim, Sang-Ki Ko and Yo-Sub Han
In Theoretical Computer Science , Vol. 994, p. 114478, May 2024 [paper]

Journal Papers

5. Matching patterns with variables under Simon’s congruence,
Pamela Fleischmann, Sungmin Kim, Tore Koß, Florin Manea, Dirk Nowotka, Stefan Siemer and Max Wiedenhöft
Accepted for publication.
4. Approximate Cartesian tree pattern matching,
Sungmin Kim and Yo-Sub Han
In Theoretical Computer Science, Vol. 1056, p. 115506, November 2025 [paper]
3. Existential and universal width of alternating finite automata,
Yo-Sub Han, Sungmin Kim, Sang-Ki Ko and Kai Salomaa
In Information and Computation, Vol. 306, p. 105337, August 2025 [paper]
2. Simon's congruence pattern matching,
Sungmin Kim, Sang-Ki Ko and Yo-Sub Han
In Theoretical Computer Science, Vol. 994, p. 114478, May 2024 [paper]
1. On Simon's congruence closure of a string,
Sungmin Kim, Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
In Theoretical Computer Science, Vol. 972, p. 114078, September 2023 [paper]

Conference Papers

9. Decomposing regular languages under shuffle along trajectories,
Sungmin Kim, Hyunki Hong, Taeryung Lim, Yo-Sub Han and Kai Salomaa
To appear in Proceedings of the 30th International Conference on Implementation and Application of Automata (CIAA'26)
8. Pattern matching under ℛ-congruence,
Sungmin Kim, Hyundong Jin and Yo-Sub Han
To appear in Proceedings of the 30th International Conference on Implementation and Application of Automata (CIAA'26)
7. Pattern mining under Simon's congruence,
Sungmin Kim and Yo-Sub Han
In Proceedings of the 29th International Conference on Developments in Language Theory (DLT'25),
pp. 182--196, 2025
[paper]
6. Approximate Cartesian tree pattern matching,
Sungmin Kim and Yo-Sub Han
In Proceedings of the 28th International Conference on Developments in Language Theory (DLT'24),
pp. 189--202, 2024
[paper]
5. Matching patterns with variables under Simon’s congruence,
Pamela Fleischmann, Sungmin Kim, Tore Koß, Florin Manea, Dirk Nowotka, Stefan Siemer and Max Wiedenhöft
In Proceedings of the 17th International Conference on Reachability Problems (RP'23),
pp. 155--170, 2023
[paper]
4. Existential and universal width of alternating finite automata,
Yo-Sub Han, Sungmin Kim, Sang-Ki Ko and Kai Salomaa
In Proceedings of the 25th International Conference on Descriptional Complexity of Formal Systems (DCFS'23),
pp. 51--64, 2023
[paper]
3. On the Simon’s congruence neighborhood of languages,
Sungmin Kim, Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
In Proceedings of the 27th International Conference on Developments in Language Theory (DLT'23),
pp. 168--181, 2023
[paper]
2. Simon's congruence pattern matching,
Sungmin Kim, Sang-Ki Ko and Yo-Sub Han
In Proceedings of the 33rd International Symposium on Algorithms and Computation (ISAAC'22),
pp. 60:1--60:17, 2022
[paper]
1. On Simon's congruence closure of a string,
Sungmin Kim, Yo-Sub Han, Sang-Ki Ko and Kai Salomaa
In Proceedings of the 24th International Conference on Descriptional Complexity of Formal Systems (DCFS'22),
pp. 127--141, 2022
[paper]