Outfix-Guided Insertion - (Extended Abstract). - Da-Jung Cho; Yo-Sub Han; Timothy Ng 001; Kai Salomaa (DLT, 2016)

Prefix Distance Between Regular Languages. - Timothy Ng 001 (CIAA, 2016)

State Complexity of Insertion. - Yo-Sub Han; Sang-Ki Ko; Timothy Ng 001; Kai Salomaa (Int. J. Found. Comput. Sci., 2016)

Quasi-Distances and Weighted Finite Automata. - Timothy Ng 001; David Rappaport; Kai Salomaa (The Role of Theory in Computer Science, 2017)

Relative Prefix Distance Between Languages. - Timothy Ng 001; David Rappaport; Kai Salomaa (DLT, 2017)

State Complexity of Prefix Distance of Subregular Languages. - Timothy Ng 001; David Rappaport; Kai Salomaa (J. Autom. Lang. Comb., 2017)

Pseudoknot-generating operation. - Da-Jung Cho; Yo-Sub Han; Timothy Ng 001; Kai Salomaa (Theor. Comput. Sci., 2017)

Outfix-guided insertion. - Da-Jung Cho; Yo-Sub Han; Timothy Ng 001; Kai Salomaa (Theor. Comput. Sci., 2017)

State complexity of prefix distance. - Timothy Ng 001; David Rappaport; Kai Salomaa (Theor. Comput. Sci., 2017)

Distances Between Languages: Algorithms and Descriptional Complexity. - Timothy Ng 001 (2017)

Word Blending in Formal Languages: The Brangelina Effect. - Srujan Kumar Enaganti; Lila Kari; Timothy Ng 001; Zihao Wang (UCNC, 2018)

State Complexity of Neighbourhoods and Approximate Pattern Matching. - Timothy Ng 001; David Rappaport; Kai Salomaa (Int. J. Found. Comput. Sci., 2018)

State Complexity of Simple Splicing. - Lila Kari; Timothy Ng 001 (DCFS, 2019)

State Complexity of Pseudocatenation. - Lila Kari; Timothy Ng 001 (LATA, 2019)

State Complexity of Suffix Distance. - Timothy Ng 001; David Rappaport; Kai Salomaa (Int. J. Found. Comput. Sci., 2019)

Word Blending in Formal Languages. - Srujan Kumar Enaganti; Lila Kari; Timothy Ng 001; Zihao Wang (Fundam. Informaticae, 2020)

Consensus string problem for multiple regular languages. - Yo-Sub Han; Sang-Ki Ko; Timothy Ng 001; Kai Salomaa (Inf. Comput., 2021)

Descriptional Complexity of Semi-Simple Splicing Systems. - Lila Kari; Timothy Ng 001 (Int. J. Found. Comput. Sci., 2021)

Conjugate word blending: formal model and experimental implementation by XPCR. - Francesco Bellamoli; Giuditta Franco; Lila Kari; Silvia Lampis; Timothy Ng 001; Zihao Wang (Nat. Comput., 2021)

Closest substring problems for regular languages. - Yo-Sub Han; Sang-Ki Ko; Timothy Ng 001; Kai Salomaa (Theor. Comput. Sci., 2021)

A Survey of Undergraduate Theory of Computing Curricula. - Ryan E. Dougherty; Tim Randolph 001; Tzu-Yi Chen; Jeff Erickson 001; Matthew Ferland; Dennis Komm; Jonathan Liu; Timothy Ng 001; Seth Poulsen; Smaranda Sandu; Michael Shindler; Edward Talmage; et al. (SIGCSE Virtual (2), 2024)