Computability of recurrence equations
Theoretical Computer Science
One-way cellular automata on Cayley graphs
Theoretical Computer Science
Transitive closure of infinite graphs and its applications
Transitive closure of infinite graphs and its applications
The Organization of Computations for Uniform Recurrence Equations
Journal of the ACM (JACM)
A framework for the recursive definition of data structures
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Journal of Computer and System Sciences
The topological structures of membrane computing
Fundamenta Informaticae - Membrane computing
The Firing Squad Synchronization Problem on Cayley Graphs
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Simulations Between Cellular Automata on Cayley Graphs
LATIN '95 Proceedings of the Second Latin American Symposium on Theoretical Informatics
Integrated regulatory networks (IRNs): Spatially organized biochemical modules
Theoretical Computer Science
| Hi-index | 0.00 |
During a discussion taking place at WMC'01, G. Paun put the question of what could be computed only by moving symbols between membranes. In this paper we provide some elements of the answer, in a setting similar to tissue P systems, where the set of membranes is organized into a finite graph or into a Cayley graph, and using a very simple propagation process characterizing accretive growth. Our main result is to characterize the final configuration as a least fixed point and to establish two series of approximations that converge to it. All the notions introduced (Cayley graph of membranes, accretive rule and iteration) have been implemented in the MGS programming language and the two approximation series can be effectively computed in Pressburger arithmetics using the omega calculator in the case of Abelian Cayley graphs.