Wen Chean Teh

Nat. Comput., June, 2024

Counting subwords in circular words and their Parikh matrices.

[BibT_eX]

[DOI]

Jamie Simpson

Theor. Comput. Sci., February, 2024

Enhanced Crop Disease Detection With EfficientNet Convolutional Group-Wise Transformer.

[BibT_eX]

[DOI]

IEEE Access, 2024

2023

Burnability of double spiders and path forests.

[BibT_eX]

[DOI]

Ta Sheng Tan

Appl. Math. Comput., 2023

2022

Evolvability of reaction systems and the invisibility theorem.

[BibT_eX]

[DOI]

Johnny Lim

Theor. Comput. Sci., 2022

A linear time algorithm for connected p-centdian problem on block graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Erasure and error correcting ability of Parikh matrices.

[BibT_eX]

[DOI]

Abdalhadi Abu Zeyneh

Inf. Process. Lett., 2022

The connected p-median problem on complete multi-layered graphs.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2022

2021

Ranks of strictly minimal reaction systems induced by permutations.

[BibT_eX]

[DOI]

Kien Trung Nguyen

Chuei Yee Chen

Theor. Comput. Sci., 2021

Freeness Problem for Matrix Semigroups of Parikh Matrices.

[BibT_eX]

[DOI]

Denis Chee-Keong Wong

Fundam. Informaticae, 2021

2020

Simulation of reaction systems by the strictly minimal ones.

[BibT_eX]

[DOI]

J. Membr. Comput., 2020

A New Study of Parikh Matrices Restricted to Terms.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2020

Parikh word representability of bipartite permutation graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Graph burning: Tight bounds on the burning numbers of path forests and spiders.

[BibT_eX]

[DOI]

Ta Sheng Tan

Appl. Math. Comput., 2020

Parikh-friendly permutations and uniformly parikh-friendly words.

[BibT_eX]

[DOI]

Australas. J Comb., 2020

2019

Topological Properties of Four-Layered Neural Networks.

[BibT_eX]

[DOI]

J. Artif. Intell. Soft Comput. Res., 2019

Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

Parikh matrices for powers of words.

[BibT_eX]

[DOI]

Acta Informatica, 2019

Parikh Determinants.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018

Order of weak M-relation and Parikh matrices.

[BibT_eX]

[DOI]

K. G. Subramanian

Somnath Bera

Theor. Comput. Sci., 2018

On strongly M-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Compositions of Functions and Permutations Specified by Minimal Reaction Systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

On M-Equivalence and Strong M-Equivalence for Parikh Matrices.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

Elementary matrix equivalence and core transformation graphs for Parikh matrices.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Parikh Motivated Study on Repetitions in Words.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Irreducible reaction systems and reaction system rank.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Ramsey Algebras and Formal Orderly Terms.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2017

Minimal Reaction Systems Revisited and Reaction System Rank.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2017

2016

On a conjecture about Parikh matrices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Ramsey algebras.

[BibT_eX]

[DOI]

J. Math. Log., 2016

Parikh Matrices and Strong M-Equivalence.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2016

Separability of M-Equivalent Words by Morphisms.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2016

A New Operator over Parikh Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2016

Parikh Matrices and Parikh Rewriting Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2016

Ramsey algebras and the existence of idempotent ultrafilters.

[BibT_eX]

[DOI]

Arch. Math. Log., 2016

2015

Core words and Parikh matrices.

[BibT_eX]

[DOI]

Kiam Heong Kwa

Theor. Comput. Sci., 2015

On Core Words and the Parikh Matrix Mapping.

[BibT_eX]

[DOI]