受强制性开放获取政策约束的文章 - Timothy Ng了解详情
可在其他位置公开访问的文章：8 篇
Outfix-guided insertion
DJ Cho, YS Han, T Ng, K Salomaa
Theoretical Computer Science 701, 70-84, 2017
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada
State complexity of insertion
YS Han, SK Ko, T Ng, K Salomaa
International Journal of Foundations of Computer Science 27 (07), 863-878, 2016
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada
Consensus string problem for multiple regular languages
YS Han, SK Ko, T Ng, K Salomaa
International Conference on Language and Automata Theory and Applications …, 2017
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada
Closest substring problems for regular languages
YS Han, SK Ko, T Ng, K Salomaa
Theoretical Computer Science 862, 144-154, 2021
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada
Word blending in formal languages
SK Enaganti, L Kari, T Ng, Z Wang
Fundamenta Informaticae 171 (1-4), 151-173, 2020
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada
Conjugate word blending: formal model and experimental implementation by XPCR
F Bellamoli, G Franco, L Kari, S Lampis, T Ng, Z Wang
Natural Computing 20 (4), 647-658, 2021
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada, Government of Italy
Pseudoknot-generating operation
DJ Cho, YS Han, T Ng, K Salomaa
Theoretical Computer Science 696, 52-64, 2017
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada
State Complexity of Pseudocatenation
L Kari, T Ng
International Conference on Language and Automata Theory and Applications …, 2019
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada
出版信息和资助信息由计算机程序自动确定