We consider a language together with the subword relation, the cover relation, and regular predicates. For such structures, we consider the extension of first-order logic by threshold- and modulo-counting quantifiers. Depending on the language, the used predicates, and the fragment of the logic, we determine four new combinations that yield decidable theories. These results extend earlier ones where only the language of all words without the cover relation and fragments of first-order logic were considered.
CITATION STYLE
Kuske, D., & Zetzsche, G. (2019). Languages Ordered by the Subword Order. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11425 LNCS, pp. 348–364). Springer Verlag. https://doi.org/10.1007/978-3-030-17127-8_20
Mendeley helps you to discover research relevant for your work.