A number of eubacterial species contain methyl-accepting taxis proteins that are antigenically and thus structurally related to the well-characterized methyl-accepting chemotaxis proteins of Escherichia coli. Recent studies of the archaebacterium Halobacterium halobium have characterized methyl-accepting taxis proteins that in some ways resemble and in other ways differ from the analogous eubac...

We continue our previous research on cooperating distributed grammar systems (CDGS) and variants thereof as language acceptors 16]. Here, we classify the accepting capacity of CDGS working in the modes recently introduced by the authors together with Freund 14]. Moreover, we study (prescribed) teams as language accepting mechanisms. In this way, we solve an open problem from the area of accepti...

1) Smoking cessation 2) Replacement of the pharmacologic (pleasurable) sensations of nicotine in cigarette products with non-cigarette products that can be viewed as providing either medicinal nicotine or analogue chemicals with similar function 3) Reduction in toxic components of cigarette smoke immediately to levels that are suggested by current science as ‘‘acceptable’’ based on existing dos...

1-800-226-6113 to cover gifts from patients as well. There is no problem with taking the occasional plate of cookies or handknitted scarf from a grateful patient, but anything more elaborate or expensive should generally be subject to the same discrimination as gifts from employees. Occasionally, employees will innocently accept a gift that exceeds corporate gift limits because they are unfamil...

In this paper we propose a condition for rejecting the input word by an accepting splicing system which is defined by a finite set of forbidding words. More precisely, the input word is accepted as soon as a permitting word is obtained provided that no forbidding word has been obtained so far, otherwise it is rejected. Note that in the new variant of accepting splicing system the input word can...

In this paper we consider the time and the crossing sequence complexities of onetape off-line Turing machines. We show that the running time of each nondeterministic machine accepting a nonregular language must grow at least as n logn, in the case all accepting computations are considered (accept measure). We also prove that the maximal length of the crossing sequences used in accepting computa...