Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-87405-8_25 | ICGT |
Keywords | Field | DocType |
pullback grammar,earlier work,context-free generation,pullback grammars,square grid,graph grammar,surprising example,pullback | Context-sensitive grammar,Rule-based machine translation,Tree-adjoining grammar,Discrete mathematics,Graph,Combinatorics,Computer science,Grammar,Rewriting,Formalism (philosophy),Pullback | Conference |
Volume | ISSN | Citations |
5214 | 0302-9743 | 1 |
PageRank | References | Authors |
0.40 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michel Bauderon | 1 | 251 | 34.56 |
| Rui Chen | 2 | 4 | 5.23 |
| Olivier Ly | 3 | 7 | 1.53 |