Titlebook: Computation, Cooperation, and Life; Essays Dedicated to Jozef Kelemen,Alica Kelemenová Book 2011 The Editor(s) (if applicable) and The Aut

TRACE

doxazosin

animated

Context Insertionsistance between two words that measures the minimal number of context insertions in one of the words in order to obtain the other. Some properties of this distance, which is actually a semimetric, are investigated.

弄皱

A Temporal Logic for Mutual Mobile Membranes with Objects on Surfacein TLA+ which could be used for verification of certain properties of the systems of mutual mobile membranes with objects on surface, and illustrate the whole process by a simple specification and its execution.

懒惰民族

tympanometry

On the Parallelizability of Languages Accepted by P Automatariant. We examine how one of the features of P automata, namely the choice of the mapping which maps the sequence of multisets imported by the system to the symbols of the alphabet of the accepted language, influences the efficient parallelizability of the accepted languages.

abracadabra

DRILL

H. Wiehn,H. Langner,H. Schusterr science journals and in many program committees of international scientific meetings etc. It was enough for a successful life. Unfortunately, many scientists, if they don’t stop, they begin to decline when they enter the fifties. How far is this situation from that of GP!

elucidate

Hans Joachim Kölbel,Martin Schmeißerallowing sequences of rules to be applied. For example, graph-controlled grammars are always at least as powerful as programmed and matrix grammars. For the simulation of random context and ordered grammars by matrix and graph-controlled grammars, some specific requirements have to be fulfilled by the types of rules.

commute

https://doi.org/10.1007/978-3-322-90526-0iction, and we relate the generative power of such CDGSs working either in a sequential or in a parallel manner and according to the aforementioned cooperation protocol, for various ., with that of context-free forbidding random context grammars, (random context) ET0L systems, and context-free programmed grammars with appearance checking.