Monadic second-order logic and the domino problem on self-similar graphs

11/05/2020 ∙ by Laurent Bartholdi, et al. ∙ 0

We consider the domino problem on Schreier graphs of self-similar groups, and more generally their monadic second-order logic. On the one hand, we prove that if the group is bounded then the graph's monadic second-order logic is decidable. This covers, for example, the Sierpiński gasket graphs and the Schreier graphs of the Basilica group. On the other hand, we already prove undecidability of the domino problem for a class of self-similar groups, answering a question by Barbieri and Sablik, and some examples including one of linear growth.



There are no comments yet.


page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.