相关论文: On semi-open codes and bi-continuing almost everyw…

The structure of multivariate semisimple codes over a finite chain ring $R$ is established using the structure of the residue field $\bar R$. Multivariate codes extend in a natural way the univariate cyclic and negacyclic codes and include…

In this paper we search for conditions on a countably compact (pseudo-compact) topological semigroup under which: (i) each maximal subgroup $H(e)$ in $S$ is a (closed) topological subgroup in $S$; (ii) the Clifford part $H(S)$(i.e. the…

We classify certain sofic shifts (the irreducible Point Extension Type, or PET, sofic shifts) up to flow equivalence, using invariants of the canonical Fischer cover. There are two main ingredients: (1) An extension theorem, for extending…

The statistical state of any (classical or quantum) system with non-trivial time evolution can be interpreted as the pointer of a clock. The quality of such a clock is given by the statistical distinguishability of its states at different…

Shifts of finite type and the notion of shadowing, or pseudo-orbit tracing, are powerful tools in the study of dynamical systems. In this paper we prove that there is a deep and fundamental relationship between these two concepts. Let $X$…

We introduce a class of codes with overlapping code words, that we call SPO-codes. The SPO-codes are related to the Markov codes that were introduced in: G. Keller, J. Combinatorial Theory 56, (1991),pp.\ 75--83. The process of generating a…

We study interacting components and their compatibility with respect to synchronous and asynchronous composition. The behavior of components is formalized by I/O-transition systems. Synchronous composition is based on simultaneous execution…

Let $f\colon X\rightarrow Y$ be a continuous surjection of compact Hausdorff spaces. By $$f_*\colon\mathfrak{M}(X)\rightarrow\mathfrak{M}(Y),\ \mu\mapsto \mu\circ f^{-1} \quad{\rm and}\quad 2^f\colon2^X\rightarrow2^Y,\ A\mapsto f[A]$$ we…

For full shifts on finite alphabets, Coelho and Quas showed that the map that sends a H\"older continuous potential $\phi$ to its equilibrium state $\mu_\phi$ is $\overline{d}$-continuous. We extend this result to the setting of full shifts…

As a variant of the equal entropy cover problem, we ask whether all multidimensional sofic shifts with countably many configurations have SFT covers with countably many configurations. We answer this question in the negative by presenting…

A condition for the synchronizability of a pair of PDE systems, coupled through a finite set of variables, is commonly the existence of internal synchronization or internal coherence in each system separately. The condition was previously…

Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about…

In this note, a condition (\emph{open persistence}) is presented under which a (pre)closure operation on submodules (resp. ideals) over rings of global sections over a scheme $X$ can be extended to a (pre)closure operation on sheaves of…

Partial orders are used extensively for modeling and analyzing concurrent computations. In this paper, we define two properties of partially ordered sets: width-extensibility and interleaving-consistency, and show that a partial order can…

Generalized synchronization is plausibly the most complex form of synchronization. Previous studies have revealed the existence of weak or strong forms of generalized synchronization depending on the multi- or mono-valued nature of the…

We show that topological mixing, weak mixing and total transitivity are equivalent for coded systems. We provide an example of a mixing coded system which cannot be approximated by any increasing sequence of mixing shifts of finite type,…

The flow equivalence of sofic shifts is examined using results about the structure of the corresponding covers. A canonical cover generalising the left Fischer cover to arbitrary sofic shifts is introduced and used to prove that the left…

Semiconstrained systems were recently suggested as a generalization of constrained systems, commonly used in communication and data-storage applications that require certain offending subsequences be avoided. In an attempt to apply…

A Code loop on a binary linear code that is doubly even with a factor set is shown to be a central loop, conjugacy closed loop, Burn loop and extra loop. General forms of the identities that define the factor set of a code are deduced.

This paper deals with synchronization of a class of infinite-dimensional systems. The considered network is described by a collection of semilinear Lipschitz boundary-actuated infinite-dimensional dynamics. For undirected connected graphs,…