Timothy Ng

ORCID

Publication Activity (10 Years)

Years Active: 2015-2021
Publications (10 Years): 30

Top Venues

DLT

Theor. Comput. Sci.

Int. J. Found. Comput. Sci.

DCFS

Queen's University at Kingston, Ontario, Canada (PHD)

Education History

Queen's University at Kingston, Ontario, Canada

PHD

Publications

Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa
Closest substring problems for regular languages. Theor. Comput. Sci. 862 (2021)
Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa
Consensus string problem for multiple regular languages. Inf. Comput. 279 (2021)
Lila Kari, Timothy Ng
Descriptional Complexity of Semi-Simple Splicing Systems. Int. J. Found. Comput. Sci. 32 (6) (2021)
Francesco Bellamoli, Giuditta Franco, Lila Kari, Silvia Lampis, Timothy Ng, Zihao Wang
Conjugate word blending: formal model and experimental implementation by XPCR. Nat. Comput. 20 (4) (2021)
Srujan Kumar Enaganti, Lila Kari, Timothy Ng, Zihao Wang
Word Blending in Formal Languages. Fundam. Informaticae 171 (1-4) (2020)
Lila Kari, Timothy Ng
Descriptional Complexity of Semi-simple Splicing Systems. DLT (2020)
Lila Kari, Timothy Ng
Descriptional Complexity of Semi-Simple Splicing Systems. CoRR (2019)
Lila Kari, Timothy Ng
State Complexity of Simple Splicing. DCFS (2019)
Timothy Ng, David Rappaport, Kai Salomaa
State Complexity of Suffix Distance. Int. J. Found. Comput. Sci. 30 (6-7) (2019)
Lila Kari, Timothy Ng
State Complexity of Pseudocatenation. LATA (2019)
Timothy Ng, David Rappaport, Kai Salomaa
State Complexity of Neighbourhoods and Approximate Pattern Matching. Int. J. Found. Comput. Sci. 29 (2) (2018)
Srujan Kumar Enaganti, Lila Kari, Timothy Ng, Zihao Wang
Word Blending in Formal Languages: The Brangelina Effect. UCNC (2018)
Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa
Closest Substring Problems for Regular Languages. DLT (2018)
Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa
Outfix-guided insertion. Theor. Comput. Sci. 701 (2017)
Timothy Ng, David Rappaport, Kai Salomaa
State Complexity of Prefix Distance of Subregular Languages. J. Autom. Lang. Comb. 22 (1-3) (2017)
Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa
Pseudoknot-generating operation. Theor. Comput. Sci. 696 (2017)
Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa
Outfix-guided insertion. CoRR (2017)
Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa
Consensus String Problem for Multiple Regular Languages. LATA (2017)
Timothy Ng, David Rappaport, Kai Salomaa
State Complexity of Suffix Distance. DCFS (2017)
Timothy Ng, David Rappaport, Kai Salomaa
State complexity of prefix distance. Theor. Comput. Sci. 679 (2017)
Timothy Ng, David Rappaport, Kai Salomaa
Relative Prefix Distance Between Languages. DLT (2017)
Timothy Ng, David Rappaport, Kai Salomaa
Quasi-Distances and Weighted Finite Automata. The Role of Theory in Computer Science (2017)
Timothy Ng
Prefix Distance Between Regular Languages. CIAA (2016)
Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa
State Complexity of Insertion. Int. J. Found. Comput. Sci. 27 (7) (2016)
Timothy Ng, David Rappaport, Kai Salomaa
State Complexity of Prefix Distance of Subregular Languages. DCFS (2016)
Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa
Outfix-Guided Insertion - (Extended Abstract). DLT (2016)
Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa
Pseudoknot-Generating Operation. SOFSEM (2016)
Timothy Ng, David Rappaport, Kai Salomaa
Quasi-Distances and Weighted Finite Automata. DCFS (2015)
Timothy Ng, David Rappaport, Kai Salomaa
State Complexity of Prefix Distance. CIAA (2015)
Timothy Ng, David Rappaport, Kai Salomaa
State Complexity of Neighbourhoods and Approximate Pattern Matching. DLT (2015)

Timothy Ng.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Timothy Ng