Related papers: Finite-state transducers for substitution tilings
Automaton models are often seen as interpretable models. Interpretability itself is not well defined: it remains unclear what interpretability means without first explicitly specifying objectives or desired attributes. In this paper, we…
We study finite-state transducers and their power for transforming infinite words. Infinite sequences of symbols are of paramount importance in a wide range of fields, from formal languages to pure mathematics and physics. While finite…
We show that any primitive substitution tiling of the plane creates a separated net which is biLipschitz to the integer lattice. Then we show that if H is a primitive Pisot substitution in an Euclidean space, for every separated net Y, that…
A tiling is a cover of R^d by tiles such as polygons that overlap only on their borders. A patch is a configuration consisting of finitely many tiles that appears in tilings. From a tiling, we can construct a dynamical system which encodes…
We consider primitive substitution tilings on R^d whose expansion maps are unimodular. We assume that all the eigenvalues of the expansion maps are algebraic conjugates with the same multiplicity. In this case, we can construct a…
We give a sufficient geometric condition for a subshift to be measurably isomorphic to a domain exchange and to a translation on a torus. And for an irreducible unit Pisot substitution, we introduce a new topology on the discrete line and…
Hereditarily finite (HF) set theory provides a standard universe of sets, but with no infinite sets. Its utility is demonstrated through a formalisation of the theory of regular languages and finite automata, including the Myhill-Nerode…
We generalize the notion of (geometric) substitution rule to obtain overlapping substitutions. Our motivating example is the substitution presented in Ziherl, Dotera and Bekku \cite{DBZ}, which features a substitution matrix with…
We consider two families of planar self-similar tilings of different nature: the tilings consisting of translated copies of the fractal sets defined by an iterated function system, and the tilings obtained as a geometrical realization of a…
We define rules for cellular automata played on quasiperiodic tilings of the plane arising from the multigrid method in such a way that these cellular automata are isomorphic to Conway's Game of Life. Although these tilings are nonperiodic,…
The class of Cyclotomic Aperiodic Substitution Tilings (CAST) is introduced. Its vertices are supported on the 2n-th cyclotomic field. It covers a wide range of known aperiodic substitution tilings of the plane with finite rotations.…
Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…
We characterize the complexity of the PATS problem for patterns of fixed height and color count in variants of the model where seed glues are either chosen or fixed and identical (so-called non-uniform and uniform variants). We prove that…
A longstanding open problem asks for an aperiodic monotile, also known as an "einstein": a shape that admits tilings of the plane, but never periodic tilings. We answer this problem for topological disk tiles by exhibiting a continuum of…
We develop an efficient method to derive a class of surface states in photonic superlattices. In a kind of infinite bichromatic superlattices satisfying some specific conditions, we obtain a finite portion of their in-gap states, which are…
This paper presents a detailed symbolic approach to the study of self-similar tilings. It uses properties of addresses associated with graph-directed iterated function systems to establish conjugacy properties of tiling spaces. Tiles may be…
The paper introduces a novel algorithm for computing the output admissible set of linear discrete-time systems subject to input saturation. The proposed method takes advantage of the piecewise-affine dynamics to propagate the output…
This paper describes a method for converting formulas in finite propositional linear-time temporal logic (Finite LTL) into finite-state automata whose languages are the models of the given formula. Finite LTL differs from traditional LTL in…
Recently Taylor and Socolar introduced an aperiodic mono-tile. The associated tiling can be viewed as a substitution tiling. We use the substitution rule for this tiling and apply the algorithm of \cite{AL} to check overlap coincidence. It…
Not all contracts are good, but all good contracts can be expressed as a finite-state transition system ("State-Transition Contracts"). Contracts that can be represented as State-Transition Contracts discretize fat-tailed risk to…