Abstract
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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Obtułowicz, A. (2012). Generalized Gandy-Pǎun-Rozenberg machines for tile systems and cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7184 LNCS, pp. 314–332). https://doi.org/10.1007/978-3-642-28024-5_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
