On the reachability of a version of graph-rewriting system
type: Item
instance of: scholarly article
title: On the reachability of a version of graph-rewriting system
zbMATH Open document ID: 1213.68352
author: Kohji Tomita
author: Haruhisa Kurokawa
published in: Information Processing Letters
publication date: 2010-08-20T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q80
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5773797
zbMATH Keywords: graph automata
zbMATH Keywords: cellular automata
zbMATH Keywords: graph-rewriting
zbMATH Keywords: interconnection network
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.03.020
OpenAlex ID: W2088327801
cites work: Q3809632
cites work: Q3999090
cites work: Handbook of Graph Grammars and Computing by Graph Transformation
cites work: Graph automata: Natural expression of self-reproduction
DOI: 10.1016/J.IPL.2009.03.020
description: scientific article; zbMATH DE number 5773797