Complexity of boundary graph languages
type: Item
instance of: scholarly article
title: Complexity of boundary graph languages
zbMATH Open document ID: 0701.68062
author: George Leih
author: Joost Engelfriet
published in: RAIRO - Theoretical Informatics and Applications
publication date: 1990-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/92359
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 4149576
zbMATH Keywords: graph languages
zbMATH Keywords: graph grammars
MaRDI profile type: Publication
OpenAlex ID: W22407023
cites work: The complexity of regular DNLC graph languages
cites work: Linear graph grammars: Power and complexity
cites work: Q3785994
cites work: Boundary graph grammars with dynamic edge relabeling
cites work: A comparison of boundary graph grammars and context-free hypergraph grammars
cites work: On the structure of node-label-controlled graph languages
cites work: Graph grammars with neighbourhood-controlled embedding
cites work: On sequential and parallel node-rewriting graph grammars
cites work: Q3714485
cites work: Q3795250
cites work: Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
cites work: Tree-size bounded alternation
cites work: On the Tape Complexity of Deterministic Context-Free Languages
cites work: Q3815544
cites work: Q3785991
DOI: 10.1051/ITA/1990240302671
description: scientific article