default search action
Wen Chean Teh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j35]Jing Feng
, Wen Eng Ong
Enhanced Crop Disease Detection With EfficientNet Convolutional Group-Wise Transformer. IEEE Access 12: 44147-44162 (2024) - [j34]Husain Intekhab, Wen Chean Teh:
Ranks of functions specified by minimal reaction systems and induced by images of singletons. Nat. Comput. 23(2): 285-293 (2024) - [j33]Ghajendran Poovanandran
Counting subwords in circular words and their Parikh matrices. Theor. Comput. Sci. 985: 114344 (2024) - 2023
- [j32]Ta Sheng Tan
Burnability of double spiders and path forests. Appl. Math. Comput. 438: 127574 (2023) - 2022
- [j31]Kien Trung Nguyen
The connected p-median problem on complete multi-layered graphs. Discret. Math. Algorithms Appl. 14(3): 2150118:1-2150118:13 (2022) - [j30]Adrian Atanasiu, Ghajendran Poovanandran
Erasure and error correcting ability of Parikh matrices. Inf. Process. Lett. 175: 106223 (2022) - [j29]Kien Trung Nguyen, Wen Chean Teh
A linear time algorithm for connected p-centdian problem on block graphs. Theor. Comput. Sci. 923: 318-326 (2022) - [j28]Wen Chean Teh
Evolvability of reaction systems and the invisibility theorem. Theor. Comput. Sci. 924: 17-33 (2022) - 2021
- [j27]Wen Chean Teh
Freeness Problem for Matrix Semigroups of Parikh Matrices. Fundam. Informaticae 179(4): 385-397 (2021) - [j26]Wen Chean Teh
Ranks of strictly minimal reaction systems induced by permutations. Theor. Comput. Sci. 872: 1-14 (2021) - 2020
- [j25]Wen Chean Teh:
Parikh-friendly permutations and uniformly parikh-friendly words. Australas. J Comb. 76: 208-219 (2020) - [j24]Ta Sheng Tan
Graph burning: Tight bounds on the burning numbers of path forests and spiders. Appl. Math. Comput. 385: 125447 (2020) - [j23]Wen Chean Teh
Parikh word representability of bipartite permutation graphs. Discret. Appl. Math. 282: 208-221 (2020) - [j22]Zi Jing Chern, K. G. Subramanian
A New Study of Parikh Matrices Restricted to Terms. Int. J. Found. Comput. Sci. 31(5): 621-638 (2020) - [j21]Wen Chean Teh
Simulation of reaction systems by the strictly minimal ones. J. Membr. Comput. 2(3): 162-170 (2020) - 2019
- [j20]Adrian Atanasiu, Ghajendran Poovanandran
Parikh matrices for powers of words. Acta Informatica 56(6): 521-535 (2019) - [j19]Ghajendran Poovanandran
Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence. Int. J. Found. Comput. Sci. 30(5): 719-733 (2019) - [j18]Muhammad Javaid
Topological Properties of Four-Layered Neural Networks. J. Artif. Intell. Soft Comput. Res. 9(2): 111-122 (2019) - 2018
- [j17]Ghajendran Poovanandran
Elementary matrix equivalence and core transformation graphs for Parikh matrices. Discret. Appl. Math. 251: 276-289 (2018) - [j16]Ghajendran Poovanandran
On M-Equivalence and Strong M-Equivalence for Parikh Matrices. Int. J. Found. Comput. Sci. 29(1): 123-138 (2018) - [j15]Wen Chean Teh
Compositions of Functions and Permutations Specified by Minimal Reaction Systems. Int. J. Found. Comput. Sci. 29(7): 1165-1179 (2018) - [j14]Wen Chean Teh
On strongly M-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices. Theor. Comput. Sci. 719: 86-93 (2018) - [j13]Wen Chean Teh
Order of weak M-relation and Parikh matrices. Theor. Comput. Sci. 743: 83-92 (2018) - 2017
- [j12]Wen Chean Teh
Minimal Reaction Systems Revisited and Reaction System Rank. Int. J. Found. Comput. Sci. 28(3): 247-262 (2017) - [j11]Wen Chean Teh
Ramsey Algebras and Formal Orderly Terms. Notre Dame J. Formal Log. 58(1): 115-125 (2017) - [j10]Wen Chean Teh
Irreducible reaction systems and reaction system rank. Theor. Comput. Sci. 666: 12-20 (2017) - 2016
- [j9]Wen Chean Teh
Ramsey algebras and the existence of idempotent ultrafilters. Arch. Math. Log. 55(3-4): 475-491 (2016) - [j8]Wen Chean Teh
Parikh Matrices and Parikh Rewriting Systems. Fundam. Informaticae 146(3): 305-320 (2016) - [j7]Wen Chean Teh
Separability of M-Equivalent Words by Morphisms. Int. J. Found. Comput. Sci. 27(1): 39-52 (2016) - [j6]Wen Chean Teh
Parikh Matrices and Strong M-Equivalence. Int. J. Found. Comput. Sci. 27(5): 545-556 (2016) - [j5]Adrian Atanasiu, Wen Chean Teh
A New Operator over Parikh Languages. Int. J. Found. Comput. Sci. 27(6): 757-770 (2016) - [j4]Wen Chean Teh
Ramsey algebras. J. Math. Log. 16(2): 1650005:1-1650005:16 (2016) - [j3]Wen Chean Teh
On a conjecture about Parikh matrices. Theor. Comput. Sci. 628: 30-39 (2016) - 2015
- [j2]Wen Chean Teh
On Core Words and the Parikh Matrix Mapping. Int. J. Found. Comput. Sci. 26(1): 123-142 (2015) - [j1]Wen Chean Teh
Core words and Parikh matrices. Theor. Comput. Sci. 582: 60-69 (2015)
Conference and Workshop Papers
- 2019
- [c1]Adrian Atanasiu, Ghajendran Poovanandran
Parikh Determinants. WORDS 2019: 68-79
Informal and Other Publications
- 2020
- [i5]Wen Chean Teh, Adrian Atanasiu:
Simulation Of Reaction Systems By The Strictly Minimal Ones. CoRR abs/2002.09033 (2020) - 2018
- [i4]Ghajendran Poovanandran, Adrian Atanasiu, Wen Chean Teh:
Parikh Motivated Study on Repetitions in Words. CoRR abs/1807.06171 (2018) - 2017
- [i3]Ghajendran Poovanandran, Wen Chean Teh:
Strong 2.t and Strong 3.t Transformations for Strong M-equivalence. CoRR abs/1702.03647 (2017) - [i2]Wen Chean Teh:
Compositions of Functions and Permutations Specified by Minimal Reaction Systems. CoRR abs/1707.01344 (2017) - 2015
- [i1]Wen Chean Teh:
Parikh matrices and Parikh Rewriting Systems. CoRR abs/1506.06476 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-14 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: