Transition Graphs of Rewriting Systems over Unranked Trees

Christof Löding, Alex Spelten. Transition Graphs of Rewriting Systems over Unranked Trees. In Ludek Kucera, Antonín Kucera, editors, Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings. Volume 4708 of Lecture Notes in Computer Science, pages 67-77, Springer, 2007. [doi]

@inproceedings{LodingS07,
  title = {Transition Graphs of Rewriting Systems over Unranked Trees},
  author = {Christof Löding and Alex Spelten},
  year = {2007},
  doi = {10.1007/978-3-540-74456-6_8},
  url = {http://dx.doi.org/10.1007/978-3-540-74456-6_8},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/LodingS07},
  cites = {0},
  citedby = {0},
  pages = {67-77},
  booktitle = {Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings},
  editor = {Ludek Kucera and Antonín Kucera},
  volume = {4708},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-74455-9},
}