1. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
2. Bak, C.: GP 2: efficient implementation of a graph programming language. Ph.D. thesis, Department of Computer Science, University of York, UK (2015).
https://etheses.whiterose.ac.uk/12586/
3. Lecture Notes in Computer Science;A Bakewell,2004
4. Berstel, J.: Transductions and Context-Free Languages. Vieweg+Teubner, Stuttgart (1979).
https://doi.org/10.1007/978-3-663-09367-1
5. Campbell, G.: Efficient graph rewriting. BSc thesis, Department of Computer Science, University of York, UK (2019).
https://arxiv.org/abs/1906.05170