As an instructional professor, I'm a member of the teaching faculty in the department. My main teaching interests are in the mathematical foundations of computer science. I teach courses in the introductory and theory sequences for the Computer Science major in the College as well as various theory courses for master's programs offered by the Department of Computer Science.
I am not currently active in research. I'm a theoretical computer scientist by training. Previously, I did research in formal languages and automata theory. I was a postdoctoral fellow in the Cheriton School of Computer Science at the University of Waterloo working with Lila Kari. I completed my PhD at Queen's University, under the supervision of Kai Salomaa and David Rappaport.
Teaching
Currently
CMSC 28000: Introduction to Formal Languages, Spring 2024 ($\times 2$)
F. Bellamoli, G. Franco, L. Kari, S. Lampis, T. Ng, and Z. Wang. Conjugate word blending: formal model and experimental implementation by XPCR.Natural Computing20, 647–658, 2021.
L. Kari and T. Ng. Descriptional Complexity of Semi-Simple Splicing Systems.International Journal of Foundations of Computer Science32(06), 685–711, 2021.
T. Ng, D. Rappaport, and K. Salomaa. State Complexity of Suffix Distance.International Journal of Foundations of Computer Science30(06&07), 203–214, 2019.
T. Ng, D. Rappaport, and K. Salomaa. State Complexity of Neighbourhoods and Approximate Pattern Matching.International Journal of Foundations of Computer Science29(02), 315–329, 2018.
T. Ng, D. Rappaport, and K. Salomaa. State Complexity of Prefix Distance of Subregular Languages.Journal of Languages, Automata, and Combinatorics22(1–3), 169–188, 2017.
Y.-S. Han, S.-K. Ko, T. Ng, and K. Salomaa. State Complexity of Insertion.International Journal of Foundations of Computer Science27(07), 863–878, 2016.
Y.-S. Han, S.-K. Ko, T. Ng, and K. Salomaa. Closest Substring Problems for Regular Languages. In: Developments in Language Theory (DLT 2018), LNCS 11088, 392–403.
S.K. Enaganti, L. Kari, T. Ng, and Z. Wang. Word blending in formal languages: The Brangelina effect. In: Unconventional Computation and Natural Computation (UCNC 2018), LNCS 10867, 72–85.
T. Ng, D. Rappaport, and K. Salomaa. State Complexity of Suffix Distance. In: Descriptional Complexity of Formal Systems (DCFS 2017), LNCS 10316, 287–298.
Y.-S. Han, S.-K. Ko, T. Ng, and K. Salomaa. Consensus String Problem for Multiple Regular Languages. In: Language and Automata Theory and Applications (LATA 2017), LNCS 10168, 196–207.
T. Ng, D. Rappaport, and K. Salomaa. State Complexity of Prefix Distance of Subregular Languages. In: Descriptional Complexity of Formal Systems (DCFS 2016), LNCS 9777, 192–204.
D.-J. Cho, Y.-S. Han, T. Ng, and K. Salomaa. Pseudoknot-Generating Operation. In: SOFSEM 2016: Theory and Practice of Computer Science, LNCS 9587, 241–252.
T. Ng, D. Rappaport, and K. Salomaa. State Complexity of Prefix Distance. In: Implementation and Applications of Automata (CIAA 2015), LNCS 9223, 238–249.
T. Ng, D. Rappaport, and K. Salomaa. State Complexity of Neighbourhoods and Approximate Pattern Matching. In: Developments in Language Theory (DLT 2015), LNCS 9168, 389–400.
T. Ng, D. Rappaport, and K. Salomaa. Quasi-distances and Weighted Finite Automata. In: Descriptional Complexity of Formal Systems (DCFS 2015), LNCS 9118, 209–219.
T. Ng, D. Rappaport, and K. Salomaa. Quasi-Distances and Weighted Finite Automata. In: The Role of Theory in Computer Science: Essays Dedicated to Janusz Brzozowski. World Scientific, 2017, 135–151.
T. Ng, D. Rappaport, and K. Salomaa. Descriptional Complexity of Error Detection. In: Emergent Computation: A Festschrift for Selim G. Akl. Springer, 2017, 101–119.