{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T05:37:49Z","timestamp":1792820269603,"version":"4.5.0"},"reference-count":45,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/lics.2017.8005061","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T16:43:24Z","timestamp":1502383404000},"page":"1-4","source":"Crossref","is-referenced-by-count":1,"title":["Logic and regular cost functions"],"prefix":"10.1109","author":[{"given":"Thomas","family":"Colcombet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1051\/ita:1999121"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603104"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-10(3:2)2014"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30124-0_7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.29"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.17"},{"key":"ref7","first-page":"21;1","article-title":"The MSO+U theory of (n, <) is undecidable","volume-title":"33rd Symposium on Theoretical Aspects of Computer Science STACS 2016, February 17-20, 2016, Orl\u00e9ans, France","author":"Boja\u0144czyk"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22993-0_52"},{"key":"ref9","first-page":"66","article-title":"Quasi-weak cost automata; A new variant of weakness","volume-title":"FSTTCS 2011; IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, volume 13 of LIPIcs","author":"Boom"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00217-X"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19600060105"},{"key":"ref12","first-page":"1","article-title":"On a decision method in restricted second order arithmetic","volume-title":"Logic, Methodology and Philosophy of Science (Proc. 1960 Internat. Congr.)","author":"B\u00fcchi"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2307\/1994916"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_12"},{"key":"ref15","first-page":"123","article-title":"Cost functions with several orders of magnitudes and the use of relative internal set theory","author":"Colcombet","year":"2013","journal-title":"LICS"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-9(3:3)2013"},{"key":"ref17","first-page":"126;1","article-title":"The Bridge Between Regular Cost Functions and Omega-Regular Languages","volume-title":"43rd InternationalColloquium on Automata, Languages, and Programming (ICALP 2016), volume 55 of Leibniz InternationalProceedings in Informatics (LIPIcs)","author":"Colcombet"},{"key":"ref18","first-page":"257","article-title":"Games with bound guess actions","volume-title":"Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS \u201916, New York, NY, USA, July 5-8, 2016","author":"Colcombet"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14162-1_47"},{"key":"ref20","first-page":"29;1","article-title":"Cost Functions Definable by Min\/Max Automata","volume-title":"33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), volume 47 of Leibniz International Proceedings in Informatics (LIPIcs)","author":"Colcombet"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87531-4_30"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_33"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.36"},{"key":"ref24","first-page":"215","article-title":"Deciding the weak definability of B\u00fcchi definable tree languages","author":"Colcombet","year":"2013","journal-title":"CSL"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1961-0139530-9"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90051-4"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/bfb0013113"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90269-8"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24727-2_19"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2005027"},{"issue":"2","key":"ref32","first-page":"173","article-title":"On the complexity of the relative inclusion star height problem","volume":"5","author":"Kirsten","year":"2010","journal-title":"Advances in Computer Scienceand Engineering"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.2168\/lmcs-10(1:4)2014"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_28"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61440-0_119"},{"key":"ref36","volume-title":"An Algebraic Method for Solving Decision Problems in Finite Automata Theory","author":"Leung","year":"1987"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16066-3_15"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16761-7_96"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00452-8"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2004.05.015"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43951-7_29"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.2307\/1995086"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017135"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/BF01691346"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19805-2_19"}],"event":{"name":"2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Reykjavik, Iceland","start":{"date-parts":[[2017,6,20]]},"end":{"date-parts":[[2017,6,23]]}},"container-title":["2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999337\/8005055\/08005061.pdf?arnumber=8005061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T04:58:37Z","timestamp":1792817917000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8005061\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/lics.2017.8005061","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}