Timothy Ng

I'm a postdoctoral fellow in the School of Computer Science at the University of Waterloo. I am a member of the Algorithms and Complexity Group and am supervised by Lila Kari.

Mail
School of Computer Science
University of Waterloo
200 University Ave. W
Waterloo, ON, Canada   N2L 3G1
Office
Davis Centre 3124
E-mail
tim.ng@uwaterloo.ca
Phone
+1 519 888 4567 ext. 33319
Curriculum vitae
PDF

Research

Broadly, my research interests belong to the field of formal languages and automata theory. My current research is focused on biological computing from a mathematical perspective via formal language theory. I also work on problems in operational state complexity of finite automata.

Teaching

Publications

A list of my publications is also available on DBLP.

Journal articles

  1. T. Ng, D. Rappaport, and K. Salomaa. State Complexity of Suffix Distance. International Journal of Foundations of Computer Science, to appear, 2018.
  2. T. Ng, D. Rappaport, and K. Salomaa. State Complexity of Neighbourhoods and Approximate Pattern Matching. International Journal of Foundations of Computer Science 29(02), 315-329, 2018.
  3. D.-J. Cho, Y.-S. Han, T. Ng, and K. Salomaa. Outfix-Guided Insertion. Theoretical Computer Science 701, 70-84, 2017.
  4. D.-J. Cho, Y.-S. Han, T. Ng, and K. Salomaa. Pseudoknot-Generating Operation. Theoretical Computer Science 696, 52-64, 2017.
  5. T. Ng, D. Rappaport, and K. Salomaa. State Complexity of Prefix Distance of Subregular Languages. Journal of Languages, Automata, and Combinatorics 22(1-3), 169-188, 2017.
  6. T. Ng, D. Rappaport, and K. Salomaa. State Complexity of Prefix Distance. Theoretical Computer Science 679, 107-117, 2017.
  7. Y.-S. Han, S.-K. Ko, T. Ng, and K. Salomaa. State Complexity of Insertion. International Journal of Foundations of Computer Science 27(07), 863-878, 2016.

Conference articles

  1. 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.
  2. 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.
  3. T. Ng, D. Rappaport, and K. Salomaa. Relative Prefix Distance Between Languages. In: Developments in Language Theory (DLT 2017), LNCS 10396, 284-295.
  4. T. Ng, D. Rappaport, and K. Salomaa. State Complexity of Suffix Distance. In: Descriptional Complexity of Formal Systems (DCFS 2017), LNCS 10316, 287-298.
  5. 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.
  6. D.-J. Cho, Y.-S. Han, T. Ng, and K. Salomaa. Outfix-Guided Insertion. In: Developments in Language Theory (DLT 2016), LNCS 9840, 102-113.
  7. T. Ng. Prefix Distance Between Regular Languages. In: Implementation and Applications of Automata (CIAA 2016), LNCS 9705, 224-235.
  8. 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.
  9. 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.
  10. T. Ng, D. Rappaport, and K. Salomaa. State Complexity of Prefix Distance. In: Implementation and Applications of Automata (CIAA 2015), LNCS 9223, 238-249.
  11. 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.
  12. 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.

Non-refereed articles

  1. 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.
  2. 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.

Service