Titlebook: Machines, Computations, and Universality; Third International Maurice Margenstern,Yurii Rogozhin Conference proceedings 2001 Springer-Verl

贞洁

Observe

相反放置

On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammarsammars with appearance checking for generating arbitrary recursively enumerable languages. Of special interest is the result that the number of non-terminal symbols used in the appearance checking mode can be restricted to two. In the case of graph controlled (and programmed grammars) with appearanc

insomnia

Speeding-Up Cellular Automata by Alternationsrray (IA), and a finite array (delimited at both ends) of n cells with parallel input mode, called a bounded cellular array (BCA). This paper presents a quadratic speedup theorem for IAs and an exponential speedup theorem for BCAs by using alternations. It is shown that for any computable functions

充足

instructive

Galactogogue

P Systems with Membrane Creation: Universality and Efficiencyly universal. In this paper, we propose a new variant of Psystems, ., in which some objects are productive and create membranes. This new variant of Psystems is capable of solving the Hamiltonian Path Problem in linear time. We show that Psystems with membrane creation are computationally complete.

者变

arge displacements in vibrations are seldom desirable, indeed, just the opposite holds true. The engineer makes efforts to arrange the vibrating system so that its motion is kept within the vicinity of a prescribed reference motion. When this is the case, the equations of motion relative to this ref

Volatile-Oils

预防注射

Asa Ben-Hur,Hava T. Siegelmannn is usually called resonance and it is characteristic for undamped and lightly damped vibrating systems. For multi-dof-systems there may exist not only one but possibly more resonance frequencies. Since the occurance of resonance in vibrating systems is undesirable, due to the large amplitudes, the