1 citations · 1 across the 6 of their papers we have counts for
12 papers
Counting Subwords in Circular Words and Their Parikh Matrices
Ghajendran Poovanandran, Jamie Simpson, Wen Chean Teh
The word inference problem is to determine languages such that the information on the number of occurrences of those subwords in the language can uniquely identify a word. A consid…
Ranks of Strictly Minimal Reaction Systems Induced by Permutations and Cartesian Product
Wen Chean Teh, Kien Trung Nguyen, Chuei Yee Chen
Reaction system is a computing model inspired by the biochemical interaction taking place within the living cells. Various extended or modified frameworks motivated by biological,…
Simulation Of Reaction Systems By The Strictly Minimal Ones
Wen Chean Teh, Adrian Atanasiu
Reaction systems, introduced by Ehrenfeucht and Rozenberg, are elementary computational models based on biochemical reactions transpiring within the living cells. Numerous studies…
Graph Burning: Tight Bounds on the Burning Numbers of Path Forests and Spiders
Ta Sheng Tan, Wen Chean Teh
In 2016, Bonato, Janssen, and Roshanbin introduced graph burning as a discrete process that models the spread of social contagion. Although the burning process is a simple algorith…
M-Ambiguity Sequences for Parikh Matrices and Their Periodicity Revisited
Wen Chean Teh, Ghajendran Poovanandran
The introduction of Parikh matrices by Mateescu et al. in 2001 has sparked numerous new investigations in the theory of formal languages by various researchers, among whom is Serba…
Parikh Word Representability of Bipartite Permutation Graphs
Wen Chean Teh, Zhen Chuan Ng, Muhammad Javaid +1
The class of Parikh word representable graphs were recently introduced. In this work, we further develop its general theory beyond the binary alphabet. Our main result shows that t…