Multidimensional tilings and MSO logic
By: Rémi Pallen, Ilkka Törmä
Potential Business Impact:
Makes computer patterns follow simple rules.
We define sets of coulourings of the infinite discrete plane using monadic second order (MSO) formulas. We determine the complexity of deciding whether such a formula defines a subshift, parametrized on the quantifier alternation complexity of the formula. We also study the complexities of languages of MSO-definable sets, giving either an exact classification or upper and lower bounds for each quantifier alternation class.
Similar Papers
On Expansions of Monadic Second-Order Logic with Dynamical Predicates
Logic in Computer Science
Lets computers check number patterns automatically.
A finer reparameterisation theorem for MSO and FO queries on strings
Logic in Computer Science
Finds patterns in text faster.
Graph neural networks and MSO
Logic in Computer Science
Lets computers understand patterns in tree-like data.