Sheng Yu

Sheng Yu

Auto-generated profile, based on publicly available information

Sheng Yu

Department of Computer Science, The University of Western Ontario, London, Ontario, Canada N6A 5B7

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2001 in RAIRO - Theoretical Informatics and Applications
Verified
Journal Article
Closed access
PDF file
AMAlexandru Mateescu
Alexandru Mateescu
ASArto Salomaa
Arto Salomaa
Kai SalomaaKai Salomaa
Kai Salomaa
SYSheng Yu
Sheng Yu
In this paper we introduce a sharpening of the Parikh mapping and investigate its basic properties. The new mapping is based on square matrices of a certain form. The classical Parikh vector appears in such a matrix as the second diagonal. However, the matrix product gives more information about a word than the Parikh vector. We characterize the matrix products and establish also an interesting interconnection between mirror images of words and inverses of .

1 January 2000
Verified
Book Chapter
Closed access
PDF file
CCCezar Câmpeanu
Cezar Câmpeanu
KSKai Salomaa
Kai Salomaa
SYSheng Yu
Sheng Yu

1 January 1992
Verified
Book Chapter
Closed access
PDF file
ASAndrew Szilard
Andrew Szilard
SYSheng Yu
Sheng Yu
KZKaizhong Zhang
Kaizhong Zhang
JSJeffrey Shallit
Jeffrey Shallit

1 July 1997 in International Journal of Theoretical Physics
Verified
Journal Article
Closed access
PDF file
Cristian S. CaludeCristian S. Calude
Cristian S. Calude
ECElena Calude
Elena Calude
Karl SvozilKarl Svozil
Karl Svozil
SYSheng Yu
Sheng Yu

7 June 2008 in Information and Computation
Verified
Journal Article
Closed access
PDF file
GLGuangwu Liu
Guangwu Liu
CMCarlos Martín-Vide
Carlos Martín-Vide
ASArto Salomaa
Arto Salomaa
SYSheng Yu
Sheng Yu

1 January 1999 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
GPGheorghe Păun
Gheorghe Păun
SYSheng Yu
Sheng Yu
The P systems were recently introduced as distributed parallel computing models of a biochemical type. Multisets of objects are placed in a hierarchical structure of membranes and they evolve according to given rules, which are applied in a synchronous manner: at each step, all objects which can evolve, from all membranes, must evolve. We consider here the case when this restriction is removed. As expected, unsynchronized systems (even using catalysts) are weaker than the synchronized ones, providing that no priority relation among rules is considered. The power of P systems is not diminished when a priority is used and, moreover, the catalysts can change their states, among two possible states for each catalyst.