@InProceedings{kuske_et_al:LIPIcs.MFCS.2020.61,
author = {Kuske, Dietrich and Schwarz, Christian},
title = {{Complexity of Counting First-Order Logic for the Subword Order}},
booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)},
pages = {61:1--61:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-159-7},
ISSN = {1868-8969},
year = {2020},
volume = {170},
editor = {Esparza, Javier and Kr\'{a}l', Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.61},
URN = {urn:nbn:de:0030-drops-127297},
doi = {10.4230/LIPIcs.MFCS.2020.61},
annote = {Keywords: Counting logic, piecewise testable languages}
}