It is well known that Thom-Boardman symbols are realized by non-increasingsequences of nonnegative integers. A natural question is whether the converseis also true. In this paper we answer this question affirmatively, that is, forany non... Y Wang,J Lin,M Ge 被引量: 0发表: 2011年 Freq...
We show that seven of these restrictions lead to computational completeness, while using the remaining one the systems are able to compute only finite singletons of non-negative integers. The obtained results complete the investigations of the computational power of generalized communicating P systems ...
The first few values of for nonnegative integers are (3) (4) (5) (6) (7) (OEIS A054654). In closed form, can be written (8) where is a Stirling number of the first kind. The Pochhammer symbol satisfies (9) the dimidiation formulas (10) (11) and the...