Pullback Grammars Are Context-Free

Authors:
Michel Bauderon;Rui Chen;Olivier Ly
Affiliations:
LaBRI - UMR 5800, Université de Bordeaux - CNRS, Talence, France 33405;Zhongnan University of Economics and Law, Wuhan, China 430073;LaBRI - UMR 5800, Université de Bordeaux - CNRS, Talence, France 33405
Venue:
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Year:
2008

Citing 5
Cited 1

Basic category theory for computer scientists

Basic category theory for computer scientists
Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
Node replacement graph grammars

Handbook of graph grammars and computing by graph transformation
Node rewriting in graphs and hypergraphs: a categorical framework

Theoretical Computer Science
A Uniform Approach to Graph Rewriting: The Pullback Approach

WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science

Context-Free Categorical Grammars

CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics

Quantified Score

Hi-index	0.00

Visualization

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.