Topological models for boundary representation: a comparison with n-dimensional generalized maps
Computer-Aided Design - Beyond solid modelling
The topological structures of membrane computing
Fundamenta Informaticae - Membrane computing
Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
Mathematical Structures in Computer Science
Picture languages: tiling systems versus tile rewriting grammars
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Solving satisfiability in the tile assembly model with a constant-size tileset
Journal of Algorithms
Pictures worth a thousand tiles, a geometrical programming language for self-assembly
Theoretical Computer Science
The Oxford Handbook of Membrane Computing
The Oxford Handbook of Membrane Computing
An algorithmic approach to tilings of hyperbolic spaces: 10 years later
CMC'10 Proceedings of the 11th international conference on Membrane computing
Randomized Gandy-Păun-Rozenberg machines
CMC'10 Proceedings of the 11th international conference on Membrane computing
| Hi-index | 0.00 |
A concept of a generalized Gandy-Păun-Rozenberg machine for modelling various systems of multidimensional tile-like compartments with common parts (tile faces) of compartment boundaries by graph rewriting is introduced, where some massive parallelism of computations or evolution processes generated by these systems is respected. The representation of Gandy---Păun---Rozenberg machines by Gandy machines in [16] is extended to the case of generalized Gandy---Păn---Rozenberg machines, where the machines represented by Gandy machines are equivalent to Turing machines.