@Article{         DBLP:journals/corr/abs-1109-5267,
  Author        = "Kobayashi, Naoki and Ong, C.-H. Luke",
  bibsource     = "DBLP, http://dblp.uni-trier.de",
  date-added    = "2013-01-28 12:05:04 +0000",
  date-modified = "2013-04-30 15:29:27 +0000",
  ee            = "http://dx.doi.org/10.2168/LMCS-7(4:9)2011",
  Journal       = "Logical Methods in Computer Science",
  Keywords      = "higher-order recursion schemes and readme",
  Number        = "4",
  Title         = "Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus",
  Volume        = "7",
  Year          = "2011",
  bdsk-url-1    = "http://www.lmcs-online.org/ojs/viewarticle.php?id=626",
  File          = "Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus - Kobayashi, Ong (0) (0) - a - a - v.pdf"
}

@Article{ DBLP:journals/corr/abs-1109-5267, Author = "Kobayashi, Naoki and Ong, C.-H. Luke", bibsource = "DBLP, http://dblp.uni-trier.de", date-added = "2013-01-28 12:05:04 +0000", date-modified = "2013-04-30 15:29:27 +0000", ee = "http://dx.doi.org/10.2168/LMCS-7(4:9)2011", Journal = "Logical Methods in Computer Science", Keywords = "higher-order recursion schemes and readme", Number = "4", Title = "Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus", Volume = "7", Year = "2011", bdsk-url-1 = "http://www.lmcs-online.org/ojs/viewarticle.php?id=626", File = "Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus - Kobayashi, Ong (0) (0) - a - a - v.pdf" }