Authors
Lukasz Kaiser, Martin Lang, Simon Leßenich, Christof Löding
Publication date
2015
Conference
LIPIcs-Leibniz International Proceedings in Informatics
Volume
41
Publisher
Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
Description
Abstract In the past years, extensions of monadic second-order logic (MSO) that can specify
boundedness properties by the use of operators referring to the sizes of sets have been
considered. In particular, the logics costMSO introduced by T. Colcombet and MSO+ U by M.
Bojanczyk were analyzed and connections to automaton models have been established to
obtain decision procedures for these logics. In this work, we propose the logic quantitative
counting MSO (qcMSO for short), which combines aspects from both costMSO and MSO+ ...
boundedness properties by the use of operators referring to the sizes of sets have been
considered. In particular, the logics costMSO introduced by T. Colcombet and MSO+ U by M.
Bojanczyk were analyzed and connections to automaton models have been established to
obtain decision procedures for these logics. In this work, we propose the logic quantitative
counting MSO (qcMSO for short), which combines aspects from both costMSO and MSO+ ...
Total citations
20153
Scholar articles
L Kaiser, M Lang, S Leßenich, C Löding - LIPIcs-Leibniz International Proceedings in Informatics, 2015
Dates and citation counts are estimated and are determined automatically by a computer program.