References

  1. Hartmut Ehrig, Annegret Habel & Hans-Jörg Kreowski (1992): Introduction to graph grammars with applications to semantic networks. Computers and Mathematics with Applications 23(6–9), pp. 557–572, doi:10.1016/0898-1221(92)90124-Z.
  2. Annegret Habel & Detlef Plump (2001): Computational Completeness of Programming Languages Based on Graph Transformation. In: Furio Honsell & Marino Miculan: Proc. Foundations of Software Science and Computation Structures (FOSSACS 2001), Lecture Notes in Computer Science 2030. Springer, pp. 230–245, doi:10.1007/3-540-45315-6_15.
  3. John E. Hopcroft, Rajeev Motwani & Jeffrey D. Ullman (2003): Introduction to automata theory, languages, and computation - international edition (2. ed). Addison-Wesley.
  4. Juraj Hromkovic (2004): Theoretical computer science. Texts in theoretical computer science, EATCS series. Springer, Berlin, doi:10.1007/978-3-662-05269-3.
  5. Hans-Jörg Kreowski (1993): Translations into the Graph Grammar Machine. In: Ronan Sleep, Rinus Plasmeijer & Marko van Eekelen: Term Graph Rewriting: Theory and Practice, chapter 13. John Wiley, New York, pp. 171–183.
  6. Hans-Jörg Kreowski, Renate Klempien-Hinrichs & Sabine Kuske (2006): Some Essentials of Graph Transformation. In: Zoltán Ésik, Carlos Martín-Vide & Victor Mitrana: Recent Advances in Formal Languages and Applications, Studies in Computational Intelligence 25. Springer, pp. 229–254, doi:10.1007/978-3-540-33461-3_9.
  7. Hans-Jörg Kreowski, Sabine Kuske & Aaron Lye (2017): Fusion Grammars: A Novel Approach to the Generation of Graph Languages. In: Detlef Plump & Juan de Lara: Proc. 10th International Conference on Graph Transformation (ICGT 2017), Lecture Notes in Computer Science 10373. Springer, pp. 90–105, doi:10.1007/978-3-319-61470-0.
  8. Hans-Jörg Kreowski, Sabine Kuske & Aaron Lye (2018): Splicing/Fusion Grammars and Their Relation to Hypergraph Grammars. In: Leen Lambers & Jens H. Weber: Proc. 11th International Conference on Graph Transformation (ICGT 2018), LNCS 10887. Springer, pp. 3–19, doi:10.1007/978-3-319-92991-0_1.
  9. Hans-Jörg Kreowski, Sabine Kuske & Aaron Lye (2019): Transformation of Petri Nets into Context-Dependent Fusion Grammars. In: Carlos Martín-Vide, Alexander Okhotin & Dana Shapira: Proc. 13th International Conference on Language and Automata Theory and Applications (LATA 2019), LNCS 11417. Springer, pp. 246–258, doi:10.1007/978-3-030-13435-8_18.
  10. Aaron Lye (2018): Decidability and Complexity of the Membership and Emptiness Problem of Fusion Grammars. In: Pre-Proc. 9th International Workshop on Graph Computation Models, (GCM 2018).
  11. Alan M. Turing (1936): On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 2(42), pp. 230–265, doi:10.1112/plms/s2-42.1.230. A correction was published in Proceedings of the London Mathematical Society. 2 (1937). 43 (6): 544–6..
  12. Tadahiro Uesu (1978): A system of graph grammars which generates all recursively enumerable sets of labelled graphs. Tsukuba journal of mathematics 2, pp. 11–26, doi:10.21099/tkbjm/1496158502.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org