On Core Words and the Parikh Matrix Mapping. - Wen Chean Teh (Int. J. Found. Comput. Sci., 2015)

Core words and Parikh matrices. - Wen Chean Teh; Kiam Heong Kwa (Theor. Comput. Sci., 2015)

Ramsey algebras and the existence of idempotent ultrafilters. - Wen Chean Teh (Arch. Math. Log., 2016)

Parikh Matrices and Parikh Rewriting Systems. - Wen Chean Teh (Fundam. Informaticae, 2016)

A New Operator over Parikh Languages. - Adrian Atanasiu; Wen Chean Teh (Int. J. Found. Comput. Sci., 2016)

Separability of M-Equivalent Words by Morphisms. - Wen Chean Teh (Int. J. Found. Comput. Sci., 2016)

Parikh Matrices and Strong M-Equivalence. - Wen Chean Teh (Int. J. Found. Comput. Sci., 2016)

Ramsey algebras. - Wen Chean Teh (J. Math. Log., 2016)

On a conjecture about Parikh matrices. - Wen Chean Teh; Adrian Atanasiu (Theor. Comput. Sci., 2016)

Minimal Reaction Systems Revisited and Reaction System Rank. - Wen Chean Teh; Adrian Atanasiu (Int. J. Found. Comput. Sci., 2017)

Ramsey Algebras and Formal Orderly Terms. - Wen Chean Teh (Notre Dame J. Formal Log., 2017)

Irreducible reaction systems and reaction system rank. - Wen Chean Teh; Adrian Atanasiu (Theor. Comput. Sci., 2017)

Parikh Motivated Study on Repetitions in Words. - Ghajendran Poovanandran; Adrian Atanasiu; Wen Chean Teh (CoRR, 2018)

Elementary matrix equivalence and core transformation graphs for Parikh matrices. - Ghajendran Poovanandran; Wen Chean Teh (Discret. Appl. Math., 2018)

On M-Equivalence and Strong M-Equivalence for Parikh Matrices. - Ghajendran Poovanandran; Wen Chean Teh (Int. J. Found. Comput. Sci., 2018)

Compositions of Functions and Permutations Specified by Minimal Reaction Systems. - Wen Chean Teh (Int. J. Found. Comput. Sci., 2018)

On strongly M-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices. - Wen Chean Teh; Adrian Atanasiu; Ghajendran Poovanandran (Theor. Comput. Sci., 2018)

Order of weak M-relation and Parikh matrices. - Wen Chean Teh; K. G. Subramanian 001; Somnath Bera (Theor. Comput. Sci., 2018)

Parikh Determinants. - Adrian Atanasiu; Ghajendran Poovanandran; Wen Chean Teh (WORDS, 2019)

Parikh matrices for powers of words. - Adrian Atanasiu; Ghajendran Poovanandran; Wen Chean Teh (Acta Informatica, 2019)

Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence. - Ghajendran Poovanandran; Wen Chean Teh (Int. J. Found. Comput. Sci., 2019)

Topological Properties of Four-Layered Neural Networks. - Muhammad Javaid; Mujahid Abbas; Jia-Bao Liu; Wen Chean Teh; Jinde Cao (J. Artif. Intell. Soft Comput. Res., 2019)

Parikh-friendly permutations and uniformly parikh-friendly words. - Wen Chean Teh (Australas. J Comb., 2020)

Graph burning: Tight bounds on the burning numbers of path forests and spiders. - Ta Sheng Tan; Wen Chean Teh (Appl. Math. Comput., 2020)

Parikh word representability of bipartite permutation graphs. - Wen Chean Teh; Zhen Chuan Ng; Muhammad Javaid; Zi Jing Chern (Discret. Appl. Math., 2020)

A New Study of Parikh Matrices Restricted to Terms. - Zi Jing Chern; K. G. Subramanian 001; Azhana Ahmad; Wen Chean Teh (Int. J. Found. Comput. Sci., 2020)

Simulation of reaction systems by the strictly minimal ones. - Wen Chean Teh; Adrian Atanasiu (J. Membr. Comput., 2020)

Freeness Problem for Matrix Semigroups of Parikh Matrices. - Wen Chean Teh; Adrian Atanasiu; Denis Chee-Keong Wong (Fundam. Informaticae, 2021)

Ranks of strictly minimal reaction systems induced by permutations. - Wen Chean Teh; Kien Trung Nguyen; Chuei Yee Chen (Theor. Comput. Sci., 2021)

The connected p-median problem on complete multi-layered graphs. - Kien Trung Nguyen; Tran Hoai Ngoc Nhan; Wen Chean Teh; Nguyen Thanh Hung (Discret. Math. Algorithms Appl., 2022)

Erasure and error correcting ability of Parikh matrices. - Adrian Atanasiu; Ghajendran Poovanandran; Abdalhadi Abu Zeyneh; Wen Chean Teh (Inf. Process. Lett., 2022)

A linear time algorithm for connected p-centdian problem on block graphs. - Kien Trung Nguyen; Wen Chean Teh; Nguyen Thanh Hung; Huong Nguyen-Thu (Theor. Comput. Sci., 2022)

Evolvability of reaction systems and the invisibility theorem. - Wen Chean Teh; Johnny Lim (Theor. Comput. Sci., 2022)

Burnability of double spiders and path forests. - Ta Sheng Tan; Wen Chean Teh (Appl. Math. Comput., 2023)

Enhanced Crop Disease Detection With EfficientNet Convolutional Group-Wise Transformer. - Jing Feng; Wen Eng Ong; Wen Chean Teh; Rui Zhang (IEEE Access, 2024)

A Note on Graph Burning of Path Forests. - Ta Sheng Tan; Wen Chean Teh (Discret. Math. Theor. Comput. Sci., 2024)

Counting subwords in circular words and their Parikh matrices. - Ghajendran Poovanandran; Jamie Simpson; Wen Chean Teh (Theor. Comput. Sci., 2024)

Ranks of functions specified by minimal reaction systems and induced by images of singletons. - Husain Intekhab; Wen Chean Teh (Nat. Comput., 2024)

Ternary is still good for Parikh matrices. - Robert Mercas; Wen Chean Teh (Theor. Comput. Sci., 2025)

Restricted reaction system ranks of some union-additive functions. - Husain Intekhab; Wen Chean Teh (J. Membr. Comput., 2025)