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

In this paper, we propose a class of P automata in which each membrane has a state, like in tissue P systems [5], and the computation starts at some initial state and ends in a final state. Unlike the automaton considered in [2], where rules are used in sequential manner, here we consider a variant such that the rules can be applied in maximal mode (as defined in tissue P systems). We show that P automata characterize the recursively enumerable sets of vectors of natural numbers.

On a class of P automata

A Centrality Entropy Maximization Problem in Shortest Path Routing Networks

Insertion grammars have been introduced in [1] and their computational power has been studied in several places. In [7] it is proved that insertion grammars with weight at least 7 can characterize recursively enumerable languages (modulo a weak coding and an inverse morphism), and the question was formulated whether or not this result can be improved. In this paper, we come up with a positive answer to this question, by decreasing the weight of the insertion grammar used to 5. We also give a characterization of recursively enumerable languages in terms of right quotients of insertion languages.

On Characterizing Recursively Enumerable Languages by Insertion Grammars

Nondeterministic, probabilistic and alternating computations on cellular array models

https://gdeepak.com/pubs/Modelling%20and%20analysis%20of%20spiking%20neural%20P%20systems%20with%20anti-spikesusing%20Pnet%20lab.pdf

Kamala Krithivasan

Papers

On a class of P automata

A Centrality Entropy Maximization Problem in Shortest Path Routing Networks

On Characterizing Recursively Enumerable Languages by Insertion Grammars

Nondeterministic, probabilistic and alternating computations on cellular array models

Modelling and analysis of spiking neural P systems with anti-spikes using Pnet lab