Context-Free Categorical Grammars
暂无分享,去创建一个
[1] Joost Engelfriet,et al. Node Replacement Graph Grammars , 1997, Handbook of Graph Grammars.
[2] Michel Bauderon,et al. A Uniform Approach to Graph Rewriting: The Pullback Approach , 1995, WG.
[3] Annegret Habel,et al. Hyperedge Replacement: Grammars and Languages , 1992, Lecture Notes in Computer Science.
[4] Hartmut Ehrig,et al. Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .
[5] Horst Herrlich,et al. Abstract and concrete categories , 1990 .
[6] Michel Bauderon,et al. Node rewriting in graphs and hypergraphs: a categorical framework , 2001, Theor. Comput. Sci..
[7] Grzegorz Rozenberg,et al. Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .
[8] Bruno Courcelle. An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars , 1987, Theor. Comput. Sci..
[9] Olivier Ly,et al. Pullback Grammars Are Context-Free , 2008, ICGT.