| State complexity of neighbourhoods and approximate pattern matching T Ng, D Rappaport, K Salomaa International Journal of Foundations of Computer Science 29 (02), 315-329, 2018 | 13 | 2018 |
| Outfix-guided insertion DJ Cho, YS Han, T Ng, K Salomaa Theoretical Computer Science 701, 70-84, 2017 | 12 | 2017 |
| State complexity of insertion YS Han, SK Ko, T Ng, K Salomaa International Journal of Foundations of Computer Science 27 (07), 863-878, 2016 | 12 | 2016 |
| Prefix distance between regular languages T Ng Implementation and Application of Automata: 21st International Conference …, 2016 | 10 | 2016 |
| State complexity of prefix distance T Ng, D Rappaport, K Salomaa Theoretical Computer Science 679, 107-117, 2017 | 7 | 2017 |
| New results on pseudosquare avoidance T Ng, P Ochem, N Rampersad, J Shallit Combinatorics on Words: 12th International Conference, WORDS 2019 …, 2019 | 5 | 2019 |
| Descriptional complexity of error detection T Ng, D Rappaport, K Salomaa Emergent Computation: A Festschrift for Selim G. Akl, 101-119, 2017 | 4 | 2017 |
| Quasi-distances and weighted finite automata T Ng, D Rappaport, K Salomaa International Workshop on Descriptional Complexity of Formal Systems, 209-219, 2015 | 4 | 2015 |
| State complexity of simple splicing L Kari, T Ng International Conference on Descriptional Complexity of Formal Systems, 197-209, 2019 | 3 | 2019 |
| Word blending in formal languages: The Brangelina effect SK Enaganti, L Kari, T Ng, Z Wang Unconventional Computation and Natural Computation: 17th International …, 2018 | 3 | 2018 |
| Consensus string problem for multiple regular languages YS Han, SK Ko, T Ng, K Salomaa International Conference on Language and Automata Theory and Applications …, 2017 | 3* | 2017 |
| Descriptional complexity of semi-simple splicing systems L Kari, T Ng International Journal of Foundations of Computer Science 32 (06), 685-711, 2021 | 2 | 2021 |
| Closest substring problems for regular languages YS Han, SK Ko, T Ng, K Salomaa Theoretical Computer Science 862, 144-154, 2021 | 2 | 2021 |
| Word blending in formal languages SK Enaganti, L Kari, T Ng, Z Wang Fundamenta Informaticae 171 (1-4), 151-173, 2020 | 2 | 2020 |
| Conjugate word blending: formal model and experimental implementation by XPCR F Bellamoli, G Franco, L Kari, S Lampis, T Ng, Z Wang Natural Computing 20 (4), 647-658, 2021 | 1 | 2021 |
| Pseudoknot-generating operation DJ Cho, YS Han, T Ng, K Salomaa Theoretical Computer Science 696, 52-64, 2017 | 1 | 2017 |
| Relative Prefix Distance Between Languages T Ng, D Rappaport, K Salomaa International Conference on Developments in Language Theory, 284-295, 2017 | 1 | 2017 |
| State complexity of prefix distance of subregular languages T Ng, D Rappaport, K Salomaa Descriptional Complexity of Formal Systems: 18th IFIP WG 1.2 International …, 2016 | 1 | 2016 |
| A Survey of Undergraduate Theory of Computing Curricula RE Dougherty, T Randolph, TY Chen, J Erickson, M Ferland, D Komm, ... Proceedings of the 2024 on ACM Virtual Global Computing Education Conference …, 2024 | | 2024 |
| State Complexity of Suffix Distance T Ng, D Rappaport, K Salomaa International Journal of Foundations of Computer Science 30 (06n07), 1197-1216, 2019 | | 2019 |
Kai SalomaaProfessor, School of Computing, Queen's UniversityVerified email at cs.queensu.ca
David RappaportQueen's UniversityVerified email at cs.queensu.ca
Yo-Sub HanDept. of Computer Science, Yonsei UniversityVerified email at yonsei.ac.kr
Lila Kari (nee Santean)Professor of Computer Science, University of Waterloo, CanadaVerified email at uwaterloo.ca
Sang-Ki KoUniversity of SeoulVerified email at uos.ac.kr
Da-Jung ChoYonsei UniversityVerified email at yonsei.ac.kr