|
Avtomatika i Telemekhanika, 1977, Issue 6, Pages 153–157
(Mi at7384)
|
|
|
|
This article is cited in 1 scientific paper (total 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.
Received: 22.12.1975
Citation:
S. V. Petrov, “The normal form of graph grammars”, Avtomat. i Telemekh., 1977, no. 6, 153–157; Autom. Remote Control, 38:6 (1977), 901–905
Linking options:
https://www.mathnet.ru/eng/at7384 https://www.mathnet.ru/eng/at/y1977/i6/p153
|
Statistics & downloads: |
Abstract page: | 165 | Full-text PDF : | 49 |
|