A finer reparameterisation theorem for MSO and FO queries on strings

Abstract

We show a theorem on monadic second-order k-ary queries on finite words. It may be illustrated by the following example: if the number of results of a query on binary strings is O(number of 0s $\times$ number of 1s), then each result can be MSO-definably identified from a 0-position, a 1-position and some finite data. Our proofs also handle the case of first-order logic / aperiodic monoids. Thus we can state and prove the folklore theorem that dimension minimisation holds for first-order string-to-string interpretations.

5 pages; not submitted to a journal yet, some details need to be fleshed out. New in v2: proof of counterexample, via N-rational series; added recent references