A system of graph grammars which generates all recursively enumerable sets of labelled graphs

DOI10.21099/tkbjm/1496158502zbMath0458.68027OpenAlexW1905682100MaRDI QIDQ1151756

Tadahiro Uesu

Publication date: 1978

Published in: Tsukuba Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.21099/tkbjm/1496158502

zbMATH Keywords

complete system of graph grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (5)

Handle NLC grammars and r. e. languages ⋮ On the generative power of sequential and parallel programmed graph grammars ⋮ Unnamed Item ⋮ From imperative to rule-based graph programs ⋮ Context-sensitive fusion grammars and fusion grammars with forbidden context are universal

This page was built for publication: A system of graph grammars which generates all recursively enumerable sets of labelled graphs