Abstract
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. © 1972, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Pavlidis, T. (1972). Linear and Context-Free Graph Grammars. Journal of the ACM (JACM), 19(1), 11–22. https://doi.org/10.1145/321679.321682
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free