On the emergence and evolution of artificial cell signaling networks

This PhD project is concerned with the evolution of Cell Signaling Networks (CSNs) in silico. CSNs are complex biochemical networks responsible for the coordination of cellular activities. We are investigating the possibility to build an evolutionary simulation platform that would allow the spontaneous emergence and evolution of Artificial Cell Signaling Networks (ACSNs). From a practical point of view, realizing and evolving ACSNs may provide novel computational paradigms for a variety of application areas. This work may also contribute to the biological understanding of the origins and evolution of real CSNs

Tree transducers, L systems, and two-way machines

A relationship between parallel rewriting systems and two-way machines is investigated. Restrictions on the “copying power” of these devices endow them with rich structuring and give insight into the issues of determinism, parallelism, and copying. Among the parallel rewriting systems considered are the top-down tree transducer; the generalized syntax-directed translation scheme and the ETOL system, and among the two-way machines are the tree-walking automaton, the two-way finite-state transducer, and (generalizations of) the one-way checking stack automaton. The. relationship of these devices to macro grammars is also considered. An effort is made .to provide a systematic survey of a number of existing results

On the Properties of Language Classes Defined by Bounded Reaction Automata

Reaction automata are a formal model that has been introduced to investigate the computing powers of interactive behaviors of biochemical reactions([14]). Reaction automata are language acceptors with multiset rewriting mechanism whose basic frameworks are based on reaction systems introduced in [4]. In this paper we continue the investigation of reaction automata with a focus on the formal language theoretic properties of subclasses of reaction automata, called linearbounded reaction automata (LRAs) and exponentially-bounded reaction automata (ERAs). Besides LRAs, we newly introduce an extended model (denoted by lambda-LRAs) by allowing lambda-moves in the accepting process of reaction, and investigate the closure properties of language classes accepted by both LRAs and lambda-LRAs. Further, we establish new relationships of language classes accepted by LRAs and by ERAs with the Chomsky hierarchy. The main results include the following : (i) the class of languages accepted by lambda-LRAs forms an AFL with additional closure properties, (ii) any recursively enumerable language can be expressed as a homomorphic image of a language accepted by an LRA, (iii) the class of languages accepted by ERAs coincides with the class of context-sensitive languages.Comment: 23 pages with 3 figure

Control Words of String Rewriting P Systems

P systems with controlled computations have been introduced and investigated in the recent past, by assigning labels to the rules in the regions of the P system and guiding the computations by control words. Here we consider string rewriting cell-like transition P system with label assigned rules working in acceptor mode and compare the obtained family of languages of control words over the rule labels with certain well-known language families. An application to chain code picture generation is also pointed out