5 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…
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 Matrices for Powers of Words
Adrian Atanasiu, Ghajendran Poovanandran, Wen Chean Teh
Certain upper triangular matrices, termed as Parikh matrices, are often used in the combinatorial study of words. Given a word, the Parikh matrix of that word elegantly computes th…
Parikh Motivated Study on Repetitions in Words
Ghajendran Poovanandran, Adrian Atanasiu, Wen Chean Teh
We introduce the notion of general prints of a word, which is substantialized by certain canonical decompositions, to study repetition in words. These associated decompositions, wh…
Strong 2.t and Strong 3.t Transformations for Strong M-equivalence
Ghajendran Poovanandran, Wen Chean Teh
Parikh matrices have been extensively investigated due to their usefulness in studying subword occurrences in words. Due to the dependency of Parikh matrices on the ordering of the…