{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:50Z","timestamp":1759638050718,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T00:00:00Z","timestamp":1405296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["259454"],"award-info":[{"award-number":["259454"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001870","name":"Foundation For Polish Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001870","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["BL 1127\/2-1"],"award-info":[{"award-number":["BL 1127\/2-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,14]]},"DOI":"10.1145\/2603088.2603104","type":"proceedings-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T13:21:45Z","timestamp":1406553705000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Two-way cost automata and cost logics over infinite trees"],"prefix":"10.1145","author":[{"given":"Achim","family":"Blumensath","sequence":"first","affiliation":[{"name":"TU Darmstadt"}]},{"given":"Thomas","family":"Colcombet","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris Diderot"}]},{"given":"Denis","family":"Kuperberg","sequence":"additional","affiliation":[{"name":"University of Warsaw"}]},{"given":"Pawe\u0142","family":"Parys","sequence":"additional","affiliation":[{"name":"University of Warsaw"}]},{"given":"Michael Vanden","family":"Boom","sequence":"additional","affiliation":[{"name":"University of Oxford"}]}],"member":"320","published-online":{"date-parts":[[2014,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Studies in Logic and The Foundations of Computer Science","volume-title":"Rudiments of μ-Calculus","author":"Arnold A.","year":"2001","unstructured":"A. Arnold and D. Niwi\u0144ski . Rudiments of μ-Calculus , volume 146 of Studies in Logic and The Foundations of Computer Science . North-Holland , 2001 . A. Arnold and D. Niwi\u0144ski. Rudiments of μ-Calculus, volume 146 of Studies in Logic and The Foundations of Computer Science. North-Holland, 2001."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.43"},{"key":"e_1_3_2_1_3_1","unstructured":"A. Blumensath M. Otto and M. Weyer. Decidability Results for the Boundedness Problem. Logical Methods in Computer Science. to appear.  A. Blumensath M. Otto and M. Weyer. Decidability Results for the Boundedness Problem. Logical Methods in Computer Science . to appear."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_6"},{"key":"e_1_3_2_1_5_1","unstructured":"M.\n      Boja\u0144czyk\n    .\n  A bounding quantifier\n  . In J. Marcinkowski and A. Tarlecki editors CSL volume \n  3210\n   of \n  LNCS pages \n  41\n  --\n  55\n  . \n  Springer 2004\n  . ISBN 3-540-23024-6.  M. Boja\u0144czyk. A bounding quantifier. In J. Marcinkowski and A. Tarlecki editors CSL volume 3210 of LNCS pages 41--55. Springer 2004. ISBN 3-540-23024-6."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.17"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19600060105"},{"key":"e_1_3_2_1_8_1","volume-title":"Regular cost functions over words","author":"Colcombet T.","year":"2009","unstructured":"T. Colcombet . Regular cost functions over words , 2009 . Manuscript at http:\/\/www.liafa.jussieu.fr\/~colcombe\/. T. Colcombet. Regular cost functions over words, 2009. Manuscript at http:\/\/www.liafa.jussieu.fr\/~colcombe\/."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_12"},{"key":"e_1_3_2_1_10_1","volume-title":"Regular cost functions, part i: Logic and algebra over words. Logical Methods in Computer Science, 9(3)","author":"Colcombet T.","year":"2013","unstructured":"T. Colcombet . Regular cost functions, part i: Logic and algebra over words. Logical Methods in Computer Science, 9(3) , 2013 . T. Colcombet. Regular cost functions, part i: Logic and algebra over words. Logical Methods in Computer Science, 9(3), 2013."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87531-4_30"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_33"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.36"},{"key":"e_1_3_2_1_14_1","unstructured":"T.\n      Colcombet D.\n      Kuperberg C.\n      L\u00f6ding and \n      M. Vanden\n      Boom\n    .\n  Deciding the weak definability of b\u00fcchi definable tree languages\n  . In S. R. D. Rocca editor CSL volume \n  23\n   of \n  LIPIcs pages \n  215\n  --\n  230\n  . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2013\n  . \n  ISBN\n   978-3-939897-60-6.  T. Colcombet D. Kuperberg C. L\u00f6ding and M. Vanden Boom. Deciding the weak definability of b\u00fcchi definable tree languages. In S. R. D. Rocca editor CSL volume 23 of LIPIcs pages 215--230. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2013. ISBN 978-3-939897-60-6."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90051-4"},{"key":"e_1_3_2_1_16_1","series-title":"LNCS","first-page":"74","volume-title":"J.-\u00c9","author":"Hashiguchi K.","year":"1988","unstructured":"K. Hashiguchi . Relative star height, star height and finite automata with distance functions . In J.-\u00c9 . Pin, editor, Formal Properties of Finite Automata and Applications, volume 386 of LNCS , pages 74 -- 88 . Springer , 1988 . ISBN 3-540-51631-X. K. Hashiguchi. Relative star height, star height and finite automata with distance functions. In J.-\u00c9. Pin, editor, Formal Properties of Finite Automata and Applications, volume 386 of LNCS, pages 74--88. Springer, 1988. ISBN 3-540-51631-X."},{"issue":"3","key":"e_1_3_2_1_17_1","first-page":"455","article-title":"Distance desert automata and the star height problem","volume":"39","author":"Kirsten D.","year":"2005","unstructured":"D. Kirsten . Distance desert automata and the star height problem . ITA , 39 ( 3 ): 455 -- 509 , 2005 . D. Kirsten. Distance desert automata and the star height problem. ITA, 39(3):455--509, 2005.","journal-title":"ITA"},{"key":"e_1_3_2_1_18_1","unstructured":"D.\n      Kuperberg\n     and \n      M. Vanden\n      Boom\n    .\n  Quasi-weak cost automata: a new variant of weakness\n  . In S. Chakraborty and A. Kumar editors FSTTCS volume \n  13\n   of \n  LIPIcs pages \n  66\n  --\n  77\n  . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2011\n  . ISBN 978-3-939897-34-7. \n  Online\n   at http:\/\/www.liafa.jussieu.fr\/~dkuperbe\/.  D. Kuperberg and M. Vanden Boom. Quasi-weak cost automata: a new variant of weakness. In S. Chakraborty and A. Kumar editors FSTTCS volume 13 of LIPIcs pages 66--77. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2011. ISBN 978-3-939897-34-7. Online at http:\/\/www.liafa.jussieu.fr\/~dkuperbe\/."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_28"},{"key":"e_1_3_2_1_20_1","volume-title":"Resource-bounded reachability on pushdown systems. Master's thesis","author":"Lang M.","year":"2011","unstructured":"M. Lang . Resource-bounded reachability on pushdown systems. Master's thesis , RWTH Aachen University , 2011 . M. Lang. Resource-bounded reachability on pushdown systems. Master's thesis, RWTH Aachen University, 2011."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02573140"},{"key":"e_1_3_2_1_22_1","unstructured":"D. E.\n      Muller A.\n      Saoudi and \n      P. E.\n      Schupp\n  . \n  Alternating automata. The weak monadic theory of the tree and its complexity\n  . In L. Kott editor ICALP volume \n  226\n   of \n  LNCS pages \n  275\n  --\n  283\n  . \n  Springer 1986\n  . ISBN 3-540-16761-7.   D. E. Muller A. Saoudi and P. E. Schupp. Alternating automata. The weak monadic theory of the tree and its complexity. In L. Kott editor ICALP volume 226 of LNCS pages 275--283. Springer 1986. ISBN 3-540-16761-7."},{"key":"e_1_3_2_1_23_1","first-page":"1","article-title":"Decidability of second-order theories and automata on infinite trees","volume":"141","author":"Rabin M. O.","year":"1969","unstructured":"M. O. Rabin . Decidability of second-order theories and automata on infinite trees . Trans. Amer. Math. Soc. , 141 : 1 -- 35 , 1969 . ISSN 0002-9947. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc., 141:1--35, 1969. ISSN 0002-9947.","journal-title":"Trans. Amer. Math. Soc."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.32.0114"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.21"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/267871.267878"},{"key":"e_1_3_2_1_27_1","series-title":"LNCS","first-page":"580","volume-title":"MFCS","author":"Boom M. Vanden","year":"2011","unstructured":"M. Vanden Boom . Weak cost monadic logic over infinite trees. In F. Murlak and P. Sankowski, editors, MFCS , volume 6907 of LNCS , pages 580 -- 591 . Springer , 2011 . ISBN 978-3-642-22992-3. M. Vanden Boom. Weak cost monadic logic over infinite trees. In F. Murlak and P. Sankowski, editors, MFCS, volume 6907 of LNCS, pages 580--591. Springer, 2011. ISBN 978-3-642-22992-3."},{"key":"e_1_3_2_1_28_1","unstructured":"M. Y.\n      Vardi\n    .\n  Reasoning about the past with two-way automata\n  . In K. G. Larsen S. Skyum and G. Winskel editors ICALP volume \n  1443\n   of \n  Lecture Notes in Computer Science pages \n  628\n  --\n  641\n  . \n  Springer 1998\n  . ISBN 3-540-64781-3.   M. Y. Vardi. Reasoning about the past with two-way automata. In K. G. Larsen S. Skyum and G. Winskel editors ICALP volume 1443 of Lecture Notes in Computer Science pages 628--641. Springer 1998. ISBN 3-540-64781-3."}],"event":{"name":"CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vienna Austria","acronym":"CSL-LICS '14"},"container-title":["Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2603088.2603104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:34Z","timestamp":1750278154000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,14]]},"references-count":28,"alternative-id":["10.1145\/2603088.2603104","10.1145\/2603088"],"URL":"https:\/\/doi.org\/10.1145\/2603088.2603104","relation":{},"subject":[],"published":{"date-parts":[[2014,7,14]]},"assertion":[{"value":"2014-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}