1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.IT2023
Algorithmic complexity and soficness of shifts in dimension two
Julien Destombes
In this manuscript we study properties of multidimensional shifts. More precisely, we study the necessary and sufficient conditions for a shift to be sofic, i.e. the boundary betwe…
cs.DM2018★ 1 cited
Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts
Julien Destombes, Andrei Romashchenko
We suggest necessary conditions of soficness of multidimensional shifts formulated in termsof resource-bounded Kolmogorov complexity. Using this technique we provide examples ofeff…