Chapter 15 – Geometric Shortest Paths and Network Optimization

http://profs.scienze.univr.it/~manca/mnc/membrane.pdf

A guide to membrane computing

Proceedings of world academy of science, engineering and technology, vol 8

Investigations into Drosophila Wing Development - Results from a Lindenmayer Model.- Fibonacci Words - A Survey.- Planar Map Generation by Parallel Binary Fission/Fusion Grammars.- Modular Trellises.- A New Proof for the DOL Sequence Equivalence Problem and its Implications.- On Compound Lindenmayer Systems.- Graph Grammars with Application Conditions.- The ETOL Hierarchy is in the OI Hierarchy.- Polyhedral Cell Shapes.- On Cyclically Overlap-Free Words in Binary Alphabets.- The Theoretical Basis of the Transplantation Experiment.- Fixed and Stationary ?-Words and ?-Languages.- DOL Schemes and Recurrent Words.- Stochastic OL Systems and Formal Power Series.- Complexity of L-Systems.- Compartmental Hybrid State Production-Diffusion Systems with Application to Prestalk-Prespore Pattern Regulation in Cellular Slime Molds.- Hierarchical Aspects of Plant Development.- Rule Trees Represent Derivations in Edge Replacement Systems.- Languages Defined by Indian Parallel Systems.- L Systems and NLOG-Reductions.- The Parikh-Boundedness of ETOL Languages of Finite Index.- Computer Networks with Compact Routing Tables.- Unconventional Leaves.- A Uniform Model for the Growth of Biological Organisms: Cooperating Sequential Processes.- Graph Technology Applied to a Software Project.- Some Systems for Map Generation.- A Programming Language for Lindenmayer Systems.- A Note on Significance of Cellular Interaction in L-System.- EOL Grammars and Search Trees.- Variation in Inflorescence Structure in Cotoneaster Franchetti.- Partial Path Groups and Parallel Graph Contractions.- When L was Young.- Equivalence Problems for Regular Sets of Word Morphisms.- Parentheses Grammars and Lindenmayer Grammars.- Array Languages and Lindenmayer Systems - A Survey.- Symmetric Distributed Termination.- Development, Growth and Time.- On the Set of all Subgraphs of the Graphs in a Boundary NLC Graph Language.- Graph-Controlled Systems - An Extension of OL Systems.

The Book of L

This is a comprehensive (and friendly) introduction to membrane computing (MC), meant to offer both computer scientists and non-computer scientists an up-to-date overview of the field. That is why the set of notions introduced here is rather large, but the presentation is informal, without proofs and with rigorous definitions given only for the basic types of P systems — symbol object P systems with multiset rewriting rules, systems with symport/antiport rules, systems with string objects, tissue-like P systems, and neural-like P systems. Besides a list of (biologically inspired or mathematically motivated) ingredients/features which can be used in systems of these types, we also mention a series of results, as well as a series of research trends and topics.

/pdf/introduction-to-membrane-computing-5cngwvz0yk.pdf

Introduction to Membrane Computing

A fountain pen in which ink is supplied to the tip of the pen under the control of a motor-actuated ink delivery device. An ink holder is formed covering the slit formation region of the pen tip to form an ink pool between the holder and pen tip. A detector is provided in the ink pool for detecting the quantity of ink therein at any time. A pen holder coupled to the pen tip includes an ink storing section opening into the ink pool, an ink delivery device coupled to the ink storing section for delivering ink under pressure, and an electrical power source and a power delivery circuit for controlling the flow of current to an operating motor.

Graph Splicing Systems.

A new mechanism for introducing nondeterminism on the cellular automaton model is introduced. It is shown that this form of nondeterminism corresponds to the traditional notion in the unbounded-time case, but there appear to be differences when real-time or linear-time cellular automata are considered. The notion is then generalised to include probabilistic and alternating computations. Restricted nondeterminism classes are also defined and studied, in an attempt to refine the power of nondeterminism.

Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models.

On the Trade-Off Between Ambiguity and Measures in Internal Contextual Grammars.

Graph splicing systems

By considering string-objects and rewriting rules, we propose a variant of tissue P systems, namely, rewriting tissue P systems We show the computational efficiency of rewriting tissue P systems by solving the Satisfiability and the Hamiltonian path problems in linear time We study the computational capacity of rewriting tissue P systems and show that rewriting tissue P systems with at most two cells and four states are computationally universal We also show the universality result of rewriting tissue P systems with at most one cell and five states Finally we propose some new directions for future work

Kamala Krithivasan

Papers

Graph Splicing Systems.

Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models.

On the Trade-Off Between Ambiguity and Measures in Internal Contextual Grammars.

Graph splicing systems

Rewriting Tissue P Systems.