Related papers: Finite Semigroups of Constant Rank, and the five B…
We present and explore a general method for deriving a Lie-Markov model from a finite semigroup. If the degree of the semigroup is $k$, the resulting model is a continuous-time Markov chain on $k$ states and, as a consequence of the product…
We present a necessary and sufficient product criterion for bipartite quantum states based on the rank of realignment matrix of density matrix. Then, this approach is generalized to multipartite systems. We first introduce the concept of…
This paper describes a novel method of compiling ranked tagging rules into a deterministic finite-state device called a bimachine. The rules are formulated in the framework of regular rewrite operations and allow unrestricted regular…
Let $C\subset\mathbb{N}^p$ be an integer polyhedral cone. An affine semigroup $S\subset C$ is a $ C$-semigroup if $| C\setminus S|<+\infty$. This structure has always been studied using a monomial order. The main issue is that the choice of…
Recurrent neural networks are a widely used class of neural architectures. They have, however, two shortcomings. First, they are often treated as black-box models and as such it is difficult to understand what exactly they learn as well as…
This paper studies the class of automaton semigroups from two perspectives: closure under constructions, and examples of semigroups that are not automaton semigroups. We prove that (semigroup) free products of finite semigroups always arise…
Finite state machines are widely used as a sound mathematical formalism that appropriately describes large scale, distributed and complex systems. Multiple interactions of finite state machines in complex systems are well captured by the…
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…
Let $\mathcal{CP}_n$ be the semigroup of partial contraction mappings on $[n]=\{1,2,\ldots,n\}$ and let $\mathcal{OCP}_n$ and $\mathcal{ORCP}_n$ be its subsemigroups consisting of all order-preserving and of all order-preserving or…
We introduce an approach for understanding control policies represented as recurrent neural networks. Recent work has approached this problem by transforming such recurrent policy networks into finite-state machines (FSM) and then analyzing…
We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which seem to be necessary to make the…
Quantum dynamical semigroups play an important role in the description of physical processes such as diffusion, radiative decay or other non-equilibrium events. Taking strongly continuous and trace preserving semigroups into consideration,…
Continuum robots (CRs), owing to their compact structure, inherent compliance, and flexible deformation, have been widely applied in various fields. By coordinating multiple CRs to form collaborative continuum robots (CCRs), task…
Fixed-point logic with rank (FPR) is an extension of fixed-point logic with counting (FPC) with operators for computing the rank of a matrix over a finite field. The expressive power of FPR properly extends that of FPC and is contained in…
The principal permanent rank characteristic sequence is a binary sequence $r_0 r_1 \ldots r_n$ where $r_k = 1$ if there exists a principal square submatrix of size $k$ with nonzero permanent and $r_k = 0$ otherwise, and $r_0 = 1$ if there…
We explore the relation between classical and quantum states in both open and closed (super)strings discussing the relevance of coherent states as a semiclassical approximation. For the closed string sector a gauge-fixing of the residual…
Reversibility of a one-dimensional finite cellular automaton (CA) is dependent on lattice size. A finite CA can be reversible for a set of lattice sizes. On the other hand, reversibility of an infinite CA, which is decided by exploring the…
We consider the previously defined notion of finite-state independence and we focus specifically on normal words. We characterize finite-state independence of normal words in three different ways, using three different kinds of asynchronous…
Let $\mathcal{C}$ be a positive integer cone and $k\in \mathcal{C}$. A $\mathcal{C}$-semigroup $S$ is $k$-positioned if for every $h\in \mathcal{C}\setminus S$ we have that $k-h$ belongs to $S$. In this work, we focus on this family of…
Mixed states are of interest in quantum mechanics for modelling partial information. More recently categorical approaches to linguistics have also exploited the idea of mixed states to describe ambiguity and hyponym / hypernym…