@inproceedings{272009aaa46246f18ec75ae7c6287759,
title = "Computability of Extender Sets in Multidimensional Subshifts",
abstract = "Subshifts are sets of colorings of Zd defined by families of forbidden patterns. Given a subshift and a finite pattern, its extender set is the set of admissible completions of this pattern. It has been conjectured that the behavior of extender sets, and in particular their growth called extender entropy [10], could provide a way to separate the classes of sofic and effective subshifts. We prove here that both classes have the same possible extender entropies: exactly the Π3 real numbers of [0,+∞).",
keywords = "Symbolic dynamics, computability, extender entropy, extender sets, sofic shifts, subshifts, tilings",
author = "Antonin Callard and Salomon, \{L{\'e}o Paviet\} and Pascal Vanier",
note = "Publisher Copyright: {\textcopyright} Antonin Callard, L{\'e}o Paviet Salomon, and Pascal Vanier.; 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025 ; Conference date: 04-03-2025 Through 07-03-2025",
year = "2025",
month = feb,
day = "24",
doi = "10.4230/LIPIcs.STACS.2025.21",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Olaf Beyersdorff and Michal Pilipczuk and Elaine Pimentel and Thang, \{Nguyen Kim\}",
booktitle = "42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025",
}