The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable

Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong. The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable. In Pawel Urzyczyn, editor, Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings. Volume 3461 of Lecture Notes in Computer Science, pages 39-54, Springer, 2005. [doi]

@inproceedings{AehligMO05:0,
  title = {The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable},
  author = {Klaus Aehlig and Jolie G. de Miranda and C.-H. Luke Ong},
  year = {2005},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3461&spage=39},
  tags = {C++},
  researchr = {https://researchr.org/publication/AehligMO05%3A0},
  cites = {0},
  citedby = {0},
  pages = {39-54},
  booktitle = {Typed Lambda Calculi and Applications, 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings},
  editor = {Pawel Urzyczyn},
  volume = {3461},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-25593-1},
}