We study “uniform” probability measures on SFT, with the motivation of having an insight into “typical” admissible configurations. We recall the known results ...

Let us color the vertices of the grid Zd or the infinite regular tree Td, using a finite number of colors, with the constraint that some predefined pairs of ...

The well-known SIFT feature is used as a local feature and the homographic consistency checking is performed using RANSAC, a random sampling method. In order to ...

Apr 26, 2024 · Jean Mairesse, Irène Marcovici. Uniform Sampling of Subshifts of Finite Type on Grids and Trees. International Journal of Foundations of ...

Sep 26, 2018 · We give a definition of topological entropy for tree shifts, prove that the limit in the definition exists, and show that it dominates the topological entropy.

May 17, 2019 · Marcovici, Uniform sampling of subshifts of finite type on grids and trees. Internat. J. Found. Comput. Sci. 28 (2017), no. 3, 263–287. [40] ...

Marcovici : “Uniform Sampling of Subshifts of Finite Type on Grids and Trees”, International Journal of Foundations of Computer Science, vol. 28 (3), pp ...

This map provides an efficient numerical method for approximating the entropies of tree shifts defined by nearest neighbor restrictions. Finally, we show that ...

These languages are sets of factors of subshifts of infinite trees. We give effective syntactic characterizations of two classes of regular tree-shift languages ...

Jul 25, 2023 · Here we connect our definition of LCLs and uniform local algorithms with the well-studied notions of subshifts of finite type and finitary ...