This article is cited in 1 paper

Automata

The normal form of graph grammars

S. V. Petrov

Moscow

Abstract: A normal form of graph grammars is proposed that uses fixed rules of immersion submersion in substitution. It is shown that any enumerable set of graphs with tags on the nodes can be generated by a grammar in normal form.

UDC: 62-50


Received: 22.12.1975

 English version: Automation and Remote Control, 1977, 38:6, 901–905

Bibliographic databases:

• 
•