Answers are grounded in this paper and cite their sources.
Topological characterizations of sets of graphs which can be generated by contextfree 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
No takes yet. Share an insight, caveat, or question.
T. Pavlidis (1972) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: