Related papers: Homotopy Bisimilarity for Higher-Dimensional Autom…
We introduce three generalizations of homotopy equivalence in digital images, to allow us to express whether a finite and an infinite digital image are similar with respect to homotopy. We show that these three generalizations are not…
We introduce the topological complexity of the work map associated to a robot system. In broad terms, this measures the complexity of any algorithm controlling, not just the motion of the configuration space of the given system, but the…
The intended model of the homotopy type theories used in Univalent Foundations is the infinity-category of homotopy types, also known as infinity-groupoids. The problem of higher structures is that of constructing the homotopy types needed…
We show how up-to techniques for (bi-)similarity can be used in the setting of weighted systems. The problems we consider are language equivalence, language inclusion and the threshold problem (also known as universality problem) for…
We describe a category, the objects of which may be viewed as models for homotopy theories. We show that for such models, ``functors between two homotopy theories form a homotopy theory'', or more precisely that the category of such models…
In this article, we study classes of multidimensional subshifts 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,…
We interpret mathematically the pair (master equation, solution of master equation) up to equivalence, as the pair (a presentation of a free triangular dga T over a combination operad O, dga map of T into C, a dga over O) up to homotopy…
We introduce acyclic polygraphs, a notion of complete categorical cellular model for (small) categories, containing generators, relations and higher-dimensional globular syzygies. We give a rewriting method to construct explicit acyclic…
Let $R=\mathbb{F}_p$ or a field of characteristic $0$. For each $R$-good topological space $Y$, we define a collection of higher cohomology operations which, together with the cohomology algebra $H^*(Y;R)$ suffice to determine $Y$ up to…
The category of presheaves on a (small) category is a suitable semantic universe to study behaviour of various dynamical systems. In particular, presheaves can be used to record the executions of a system and their morphisms correspond to…
The paper establishes an equivalence between directed homotopy categories of (diagrams of) cubical sets and (diagrams of) directed topological spaces. This equivalence both lifts and extends an equivalence between classical homotopy…
We define two model structures on the category of bicomplexes concentrated in the right half plane. The first model structure has weak equivalences detected by the totalisation functor. The second model structure's weak equivalences are…
We investigate networks of automata that synchronise over common action labels. A graph synchronisation topology between the automata is defined in such a way that two automata are connected iff they can synchronise over an action. We show…
Constructions of spectra from symmetric monoidal categories are typically functorial with respect to strict structure-preserving maps, but often the maps of interest are merely lax monoidal. We describe conditions under which one can…
Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called forward and backward simulations. In addition, it is shown in…
We describe recent nonlinear analytic approximation tools in the classical setting of Hardy spaces in the upper half plane and show how to transfer them to the higher dimensional real setting of harmonic functions in upper half spaces. It…
Asymptotic analysis on some statistical properties of the random binary-tree model is developed. We quantify a hierarchical structure of branching patterns based on the Horton-Strahler analysis. We introduce a transformation of a binary…
Homotopy is an important feature of associative and Jordan algebraic structures: such structures always come in families whose members need not be isomorphic among other, but still share many important properties. One may regard homotopy as…
We generalize the concept of stack one dimension higher, introducing a notion of 2-stack suitable for a trihomomorphism from a 2-category equipped with a bitopology into the tricategory of bicategories. Moreover, we give a characterization…
The study of neural computation aims to understand the function of a neural system as an information processing machine. Neural systems are undoubtedly complex, necessitating principled and automated tools to abstract away details to…