Timothy Ng

I'm a PhD student in the School of Computing at Queen's University. I am a member of the Formal Languages and Automata Theory Group and am supervised by Dr. Kai Salomaa and Dr. David Rappaport.

Mail
School of Computing
Queen's University
Kingston, ON, Canada   K7L 3N6
Lab
Goodwin Hall 235
E-mail
ng@cs.queensu.ca

Research

My main field of interest is formal languages and automata theory. My current research is focused on problems in operational state complexity of finite automata and distance measures on languages.

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 Neighbourhoods and Approximate Pattern Matching. To appear in International Journal of Foundations of Computer Science.
  2. 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.
    [journal]
  3. T. Ng, D. Rappaport, and K. Salomaa. State Complexity of Prefix Distance. Theoretical Computer Science (2016), 10.1016/j.tcs.2016.05.018.
    [preprint] [journal]

Conference articles

  1. 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, pp.196-207.
    [proceedings]
  2. D.-J. Cho, Y.-S. Han, T. Ng, and K. Salomaa. Outfix-Guided Insertion. In: Developments in Language Theory (DLT 2016), LNCS 9840, pp.102-113.
    [preprint] [talk] [proceedings]
  3. T. Ng. Prefix Distance Between Regular Languages. In: Implementation and Applications of Automata (CIAA 2016), LNCS 9705, pp.224-235.
    [preprint] [talk] [proceedings]
  4. 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, pp.192-204.
    [preprint] [talk] [proceedings]
  5. 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, pp.241-252.
    [preprint] [proceedings]
  6. T. Ng, D. Rappaport, and K. Salomaa. State Complexity of Prefix Distance. In: Implementation and Applications of Automata (CIAA 2015), LNCS 9223, pp.238-249.
    [preprint] [talk] [proceedings]
  7. T. Ng, D. Rappaport, and K. Salomaa. State Complexity of Neighbourhoods and Approximate Pattern Matching. In: Developments in Language Theory (DLT 2015), LNCS 9168, pp.389-400.
    [preprint] [talk] [proceedings]
  8. T. Ng, D. Rappaport, and K. Salomaa. Quasi-distances and Weighted Finite Automata. In: Descriptional Complexity of Formal Systems (DCFS 2015), LNCS 9118, pp.209–219.
    [preprint] [talk] [proceedings]

Non-refereed articles

  1. T. Ng, D. Rappaport, and K. Salomaa. Descriptional Complexity of Error Detection. In: Emergent Computation: A Festschrift for Selim G. Akl. Springer, 2017, pp.101-119.
    [preprint] [book]