StringologyTimes

IJTCS-FAW for Stringologist

IJTCS-FAW 2025

1. k-Universality of Regular Languages Revisited.
2. Finding a Set of Long Common Substrings with Repeats from m Input Strings.

IJTCS-FAW 2024

1. [Longest (k]-Tuple Common Substrings.](https://doi.org/10.1007/978-981-97-7752-5_8)

This site is open source. Improve this page.