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

Motivated by the idea of describing parquet deformations using grammars and also of describing an infinite number of terminals starting with only a finite set, this paper defines a terminal weighted grammar, where the terminal generated at any step of a derivation is defined as a function of time It is seen that terminal weighted regular grammars generate exactly the class of recursively enumerable sets Terminal weighted matrix grammars are used to describe parquet deformations The extension of terminal weights to array grammars is also discussed

Terminal weighted grammars and picture description

In this paper, we consider two machine models equivalent in power to Turing machines. Time varying finite automata are defined and it is shown that time varying nondeterministic finite automata are equivalent to time varying deterministic finite automata. But, we find that, when e-moves are introduced, the power is increased to that of Turing machines. Equivalence between time varying regular grammars [6] and time varying nondeterministic finite automata with e-moves is shown. We also consider time varying generalized finite automata and show their equivalence to terminal weighted regular grammars [5], thus proving that time varying generalized finite automata have the same power as Turing machines.

Time varying finite automata

We consider automata systems consisting of several pushdown automata working in parallel and communicating the contents of their stacks by request. We show that centralized non-returning parallel communicating pushdown automata systems with three components recognize all recursively enumerable languages. We also show that centralized returning pushdown automata systems accept non-ET0L languages. We study two variants of communication: one uses filters in communication and in the other only specified number of symbols are communicated. We prove that all these systems accept the family of recursively enumerable languages both in the centralized and in the non-centralized strategies and in both returning and non-returning communication modes with only two components.

Some variants in communication of parallel communicating pushdown automata

Hexagonal Cellular Automata.

The paper considers spiking neural P systems (SN P systems) with cooperating rules where each neuron has the same number of sets of rules, labelled identically. Each set is called a component (maybe empty). At each step only one of the components can be active for the whole system, and only the rules from the active component are enabled. Each neuron with enabled rules from this active component can fire. By using 59 neurons, a small universal SN P system with two components, working in the terminating mode, is constructed for computing functions.

Kamala Krithivasan

Papers

Terminal weighted grammars and picture description

Time varying finite automata

Some variants in communication of parallel communicating pushdown automata

Hexagonal Cellular Automata.

Small Universal Spiking Neural P Systems with Cooperating Rules as Function Computing Devices