论文信息 - Pullback Grammars Are Context-Free

Pullback Grammars Are Context-Free

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.

Olivier Ly | Rui Chen | Michel Bauderon

[1] Benjamin C. Pierce,et al. Basic category theory for computer scientists , 1991, Foundations of computing.

[2] Michel Bauderon,et al. Pullback rewriting and applications , 2004 .

[3] Hartmut Ehrig,et al. Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[4] Grzegorz Rozenberg,et al. Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[5] Bruno Courcelle. An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars , 1987, Theor. Comput. Sci..

[6] Michel Bauderon,et al. Node rewriting in graphs and hypergraphs: a categorical framework , 2001, Theor. Comput. Sci..

[7] Michel Bauderon,et al. Pullback rewriting and applications , 2001, Electron. Notes Theor. Comput. Sci..

[8] Joost Engelfriet,et al. Node Replacement Graph Grammars , 1997, Handbook of Graph Grammars.

[9] Michel Bauderon,et al. A Uniform Approach to Graph Rewriting: The Pullback Approach , 1995, WG.