Reachability in Register Machines with Polynomial Updates

Alain Finkel, Stefan Göller, Christoph Haase. Reachability in Register Machines with Polynomial Updates. In Krishnendu Chatterjee, Jiri Sgall, editors, Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings. Volume 8087 of Lecture Notes in Computer Science, pages 409-420, Springer, 2013. [doi]

@inproceedings{FinkelGH13,
  title = {Reachability in Register Machines with Polynomial Updates},
  author = {Alain Finkel and Stefan Göller and Christoph Haase},
  year = {2013},
  doi = {10.1007/978-3-642-40313-2_37},
  url = {http://dx.doi.org/10.1007/978-3-642-40313-2_37},
  researchr = {https://researchr.org/publication/FinkelGH13},
  cites = {0},
  citedby = {0},
  pages = {409-420},
  booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings},
  editor = {Krishnendu Chatterjee and Jiri Sgall},
  volume = {8087},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-40312-5},
}