Generalized Gandy-Păun-Rozenberg Machines for Tile Systems and Cellular Automata

DOI10.1007/978-3-642-28024-5_21zbMath1352.68086OpenAlexW1874124159MaRDI QIDQ2890298

Adam Obtułowicz

Publication date: 8 June 2012

Published in: Membrane Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28024-5_21

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cellular automata (computational aspects) (68Q80)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topological rewriting and the geometrization of programming
• Pictures worth a thousand tiles, a geometrical programming language for self-assembly
• Topological models for boundary representation: A comparison with \(n\)- dimensional generalized maps
• Cellular automata, matrix substitutions and fractals
• Picture languages: tiling systems versus tile rewriting grammars.
• An Algorithmic Approach to Tilings of Hyperbolic Spaces: 10 Years Later
• Randomized Gandy-Păun-Rozenberg Machines
• Solving satisfiability in the tile assembly model with a constant-size tileset
• Symmetric monoidal and cartesian double categories as a semantic framework for tile logic

This page was built for publication: Generalized Gandy-Păun-Rozenberg Machines for Tile Systems and Cellular Automata