Skip to main content
Conference Proceedings

Pullback grammars are context-free

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5214 LNCS 366-378
DOI: 10.1007/978-3-540-87405-8_25
4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Following earlier work on pullback rewriting, we describe here the notion of graph grammar relevant to our formalism. We then show that pullback grammars are context-free and provide a surprising example, namely the context-free generation of square grids. © 2008 Springer-Verlag Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Bauderon, M., Chen, R., & Ly, O. (2008). Pullback grammars are context-free. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5214 LNCS, pp. 366–378). Springer Verlag. https://doi.org/10.1007/978-3-540-87405-8_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free