Characteristics of graph languages Generated by edge replacement

Authors:
A. Habel;H.-J. Kreowski
Affiliations:
Univ. Bremen, Bremen, W. Germany;Univ. Bremen, Bremen, W. Germany
Venue:
Theoretical Computer Science
Year:
1987

Citing 0
Cited 3

Treewidth: structure and algorithms

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
About graph and hypergraph context free grammars

Proceedings of the 15th WSEAS international conference on Computers
EXPANDING GRAPH RELABELING SYSTEMS HAVE THE POWER OF RECURSIVE ENUMERABILITY

Fundamenta Informaticae

Quantified Score

Hi-index	5.23

Visualization

Abstract