#### Filter Results:

#### Publication Year

2011

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We present constructions of countable two-dimensional subshifts of finite type (SFTs) with interesting properties. Our main focus is on properties of the topological derivatives and sub-pattern posets of these objects. We present a countable SFT whose iterated derivatives are maximally complex from the computational point of view, constructions of countable… (More)

We prove a conjecture from [Guillon-Richard '08] by showing that cellular automata that eventually fix all cells to a fixed symbol 0 are nilpotent on S Z d for all d. We also briefly discuss nilpotency on other subshifts, and show that weak nilpotency implies nilpotency in all subshifts and all dimensions, since we do not know a published reference for this.

We study the message size complexity of recognizing, under the broadcast congested clique model, whether a fixed graph H appears in a given graph G as a minor, as a subgraph or as an induced subgraph. The n nodes of the input graph G are the players, and each player only knows the identities of its immediate neighbors. We are mostly interested in the… (More)

We study the computational and structural aspects of countable two-dimensional SFTs and other subshifts. Our main focus is on the topological derivatives and subpattern posets of these objects, and our main results are constructions of two-dimensional countable subshifts with interesting properties. We present an SFT whose iterated derivatives are maximally… (More)

Picture walking automata were introduced by M. Blum and C. Hewitt in 1967 as a generalization of one-dimensional two-way finite automata to recognize pictures, or two-dimensional words. Several variants have been investigated since then, including deterministic, non-deterministic and alternating transition rules; four-, three-and two-way movements;… (More)

It is well-known that the Toffoli gate and the negation gate together yield a universal gate set, in the sense that every permutation of {0, 1} n can be implemented as a composition of these gates. Since every bit operation that does not use all of the bits performs an even permutation, we need to use at least one auxiliary bit to perform every permutation,… (More)

In this article, we study classes of multidimensional sub-shifts defined by multihead finite automata, in particular the hierarchy of classes of subshifts defined as the number of heads grows. The hierarchy collapses on the third level, where all co-recursively enumerable subshifts are obtained in every dimension. We also compare these classes to SFTs and… (More)

In this article, we prove that for all pairs of primitive Pisot or uniform substitutions with the same dominating eigenvalue, there exists a finite set of block maps such that every block map between the corresponding subshifts is an element of this set, up to a shift. This result is proved using a common generalization of block maps and substitutions,… (More)