Eliminating Recursion in the µ-Calculus

Martin Otto. Eliminating Recursion in the µ-Calculus. In Christoph Meinel, Sophie Tison, editors, STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings. Volume 1563 of Lecture Notes in Computer Science, pages 531-540, Springer, 1999. [doi]

@inproceedings{Otto99:2,
  title = {Eliminating Recursion in the µ-Calculus},
  author = {Martin Otto},
  year = {1999},
  url = {http://link.springer.de/link/service/series/0558/bibs/1563/15630531.htm},
  researchr = {https://researchr.org/publication/Otto99%3A2},
  cites = {0},
  citedby = {0},
  pages = {531-540},
  booktitle = {STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings},
  editor = {Christoph Meinel and Sophie Tison},
  volume = {1563},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
}