Timothy Ng
Timothy Ng
Verified email at uchicago.edu - Homepage
Title
Cited by
Cited by
Year
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
112018
State complexity of insertion
YS Han, SK Ko, T Ng, K Salomaa
International Journal of Foundations of Computer Science 27 (07), 863-878, 2016
82016
Outfix-guided insertion
DJ Cho, YS Han, T Ng, K Salomaa
Theoretical Computer Science 701, 70-84, 2017
62017
State complexity of prefix distance
T Ng, D Rappaport, K Salomaa
Theoretical Computer Science 679, 107-117, 2017
62017
Prefix distance between regular languages
T Ng
International Conference on Implementation and Application of Automata, 224-235, 2016
62016
Descriptional complexity of error detection
T Ng, D Rappaport, K Salomaa
Emergent Computation, 101-119, 2017
42017
Quasi-distances and weighted finite automata
T Ng, D Rappaport, K Salomaa
THE ROLE OF THEORY IN COMPUTER SCIENCE: Essays Dedicated to Janusz …, 2017
42017
Consensus string problem for multiple regular languages
YS Han, SK Ko, T Ng, K Salomaa
Information and Computation 279, 104615, 2021
32021
State complexity of simple splicing
L Kari, T Ng
International Conference on Descriptional Complexity of Formal Systems, 197-209, 2019
22019
Word blending in formal languages: The Brangelina effect
SK Enaganti, L Kari, T Ng, Z Wang
International Conference on Unconventional Computation and Natural …, 2018
22018
Descriptional Complexity of Semi-Simple Splicing Systems
L Kari, T Ng
International Journal of Foundations of Computer Science, 1-27, 2021
12021
Closest substring problems for regular languages
YS Han, SK Ko, T Ng, K Salomaa
Theoretical Computer Science 862, 144-154, 2021
12021
Word Blending in Formal Languages
SK Enaganti, L Kari, T Ng, Z Wang
Fundamenta Informaticae 171 (1-4), 151-173, 2020
12020
Pseudoknot-generating operation
DJ Cho, YS Han, T Ng, K Salomaa
Theoretical Computer Science 696, 52-64, 2017
12017
State complexity of prefix distance of subregular languages
T Ng, D Rappaport, K Salomaa
International Conference on Descriptional Complexity of Formal Systems, 192-204, 2016
12016
Conjugate word blending: formal model and experimental implementation by XPCR
F Bellamoli, G Franco, L Kari, S Lampis, T Ng, Z Wang
Natural Computing, 1-12, 2021
2021
State Complexity of Suffix Distance
T Ng, D Rappaport, K Salomaa
International Journal of Foundations of Computer Science 30 (06n07), 1197-1216, 2019
2019
State Complexity of Pseudocatenation
L Kari, T Ng
International Conference on Language and Automata Theory and Applications …, 2019
2019
Relative Prefix Distance Between Languages
T Ng, D Rappaport, K Salomaa
International Conference on Developments in Language Theory, 284-295, 2017
2017
Distances between languages: Algorithms and descriptional complexity
T Ng
Queen's University (Canada), 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–20