Related papers: Decidable problems in substitution shifts
Dendric shifts are defined by combinatorial restrictions of the extensions of the words in their languages. This family generalizes well-known families of shifts such as Sturmian shifts, Arnoux-Rauzy shifts and codings of interval exchange…
This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…
Regularity properties of the pressure are related to phase transitions. In this article we study thermodynamic formalism for systems defined in non-compact phase spaces, our main focus being countable Markov shifts. We produce metric…
Recent work has identified nonlinear deterministic structure in neuronal dynamics using periodic orbit theory. Troublesome in this work were the significant periods of time where no periodic orbits were extracted - "dynamically dark"…
We consider the problem of enumerating the number of irreducible transformation shift registers. We give an asymptotic formula for the number of irreducible transformation shift registers in some special cases. Moreover, we derive a short…
In this work we propose a new type of shift spaces, called blur shift spaces, where one can represent with a single symbol an entire set of infinite symbols. Such shift spaces are constructed from classical shift spaces, by choosing some…
In this note we give a simple unifying proof of the undecidability of several diagrammatic properties of term rewriting systems that include: local confluence, strong confluence, diamond property, subcommutative property, and the existence…
We prove that if $A$ is a string algebra then there are not three irreducible morphisms between indecomposable $A$-modules such that its composition belongs to $\Re^{6} \backslash \Re^{7}$, whenever the compositions of two of them are not…
The main result of this paper is that every naturally reductive space can be explicitly constructed from the construction in \cite{Storm2018}. This gives us a general formula for any naturally reductive space and from this we prove…
We show that the determinization problem for min-plus (tropical) weighted automata is decidable, thus resolving this long-standing open problem. In doing so, we develop a new toolbox for analyzing and reasoning about the run-structure of…
The automorphism group of a one dimensional shift space over a finite alphabet exhibits different types of behavior: for a large class with positive entropy, it contains a rich collection of subgroups, while for many shifts of zero entropy,…
Analysis of cryptographic protocols in a symbolic model is relative to a deduction system that models the possible actions of an attacker regarding an execution of this protocol. We present in this paper a transformation algorithm for such…
We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of substitutive systems are substitutive. As an application we obtain a complete characterisation of the sets of words that can appear…
A sharp bound on the number of invariant components of an interval exchange transformation is provided. More precisely, it is proved that the number of periodic components n_per and the number of minimal components n_min of an interval…
We propose a rigorous decomposition of predictive error, highlighting that not all 'irreducible' error is genuinely immutable. Many domains stand to benefit from iterative enhancements in measurement, construct validity, and modeling. Our…
We study some basic properties of sofic-Dyck shifts and finite-type-Dyck shifts. We prove that the class of sofic-Dyck shifts is stable under proper conjugacies. We prove a Decomposition Theorem of a proper conjugacy between edge-Dyck…
The study of the regularity of the minimizer of the weighted anisotropic total variation with a general fidelity term is at the heart of this paper. We generalized some recent results on the inclusion of the discontinuities of the minimizer…
We classify the irreducible projective representations of symmetric and alternating groups of minimal possible and second minimal possible dimensions, and get a lower bound for the third minimal dimension. On the way we obtain some new…
While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…
In this paper we present two different problems within the framework of shift-invariant theory. First, we develop a triangular form for shift-preserving operators acting on finitely generated shift-invariant spaces. In case of the normal…