CumInCAD is a Cumulative Index about publications in Computer Aided Architectural Design
supported by the sibling associations ACADIA, CAADRIA, eCAADe, SIGraDi, ASCAAD and CAAD futures

authors Pavlidis, T.
year 1972
title Linear and Context-Free Graph Grammars
source Journal of the Association for Computing Machinery 19 pp. 11-22
summary Topological characterizations of sets of graphs which can be generated by context- free or linear grammars are given. It is shown, for example, that the set of all planar graphs cannot be generated by a context-free grammar while the set of all outerplanar graphs can
series journal paper
full text file.pdf (650,891 bytes)
references Content-type: text/plain
last changed 2003/04/23 13:50
HOMELOGIN (you are user _anon_408525 from group guest) Works Powered by SciX Open Publishing Services 1.002