Related papers: Finite-state transducers for substitution tilings
Finite-state complexity is a variant of algorithmic information theory obtained by replacing Turing machines with finite transducers. We consider the state-size of transducers needed for minimal descriptions of arbitrary strings and, as our…
Finite-state morphology in the general tradition of the Two-Level and Xerox implementations has proved very successful in the production of robust morphological analyzer-generators, including many large-scale commercial systems. However, it…
We consider tiling dynamical systems and topological conjugacies between them. We prove that the criterion of being finite type is invariant under topological conjugacy. For substitution tiling systems under rather general conditions,…
Two new series of substitution tilings are introduced in which the tiles appear in infinitely many orientations. It is shown that several properties of the well-known pinwheel tiling do also hold for these new examples, and, in fact, for…
This paper summarizes the fundamental expressiveness, closure, and decidability properties of various finite-state automata classes with multiple input tapes. It also includes an original algorithm for the intersection of one-way…
We over-approximate reachability sets in string rewriting by languages defined by admissible factors, called tiles. A sparse set of tiles contains only those that are reachable in derivations, and is constructed by completing an automaton.…
We first prove that the set of domino tilings of a fixed finite figure is a distributive lattice, even in the case when the figure has holes. We then give a geometrical interpretation of the order given by this lattice, using (not…
We contribute results for a set of fundamental problems in the context of programmable matter by presenting algorithmic methods for evaluating and manipulating a collective of particles by a finite automaton that can neither store…
We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…
We introduce a procedure for establishing pure discrete spectrum for substitution tiling systems of Pisot family type and illustrate with several examples.
We consider tilings of Euclidean spaces by polygons or polyhedra, in particular, tilings made by a substitution process, such as the Penrose tilings of the plane. We define an isomorphism invariant related to a subgroup of rotations and…
In the light of recent studies of BPS triple junctions in the Wess-Zumino model we describe techniques to construct infinite lattices using similar junctions. It is shown that whilst these states are only approximately locally BPS they are…
This paper is intended to provide an introduction to the theory of substitution tilings. For our purposes, tiling substitution rules are divided into two broad classes: geometric and combinatorial. Geometric substitution tilings include…
The fixed point construction is a method for designing tile sets and cellular automata with highly nontrivial dynamical and computational properties. It produces an infinite hierarchy of systems where each layer simulates the next one. The…
A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…
This paper describes the celebrated aperiodic hat tiling by Smith et al. [Comb. Theory 8 (2024), 6] as generated by an overlapping iterated function system. We briefly introduce and study infinite sequences of iterated function systems that…
There is a growing body of results in the theory of discrete point sets and tiling systems giving conditions under which such systems are pure point diffractive. Here we look at the opposite direction: what can we infer about a discrete…
The top of the attractor $A$ of a hyperbolic iterated function system $\left\{ f_{i}:\mathbb{R}^{n}\rightarrow\mathbb{R}^{n}|i=1,2,\dots,M\right\} $ is defined and used to extend self-similar tilings to overlapping systems. The theory…
This paper is about the tiling dynamical systems approach to the study of aperiodic order. We compare and contrast four related types of systems: ordinary (one-dimensional) symbolic systems, one-dimensional tiling systems, multidimensional…
The truly chaotic finite machines introduced by authors in previous research papers are presented here. A state of the art in this discipline, encompassing all previous mathematical investigations, is provided, explaining how finite state…