Metatheorems for decision problems on hyperedge replacement graph languages

Authors:
A. Habel;H.-J. Kreowski;W. Vogler
Affiliations:
Univ. Bremen, Bremen, West Germany;Univ. Bremen, Bremen, West Germany;Technische Univ. Mu¨nchen, Mu¨nchen, West Germany
Venue:
Acta Informatica
Year:
1989

Citing 0
Cited 2

The complexity of connectivity problems on context-free graph languages

Journal of Computer and System Sciences
(UN-)DECIDABILITY OF GEOMETRIC PROPERTIES OF PICTURES GENERATED BY COLLAGE GRAMMARS

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract