相关论文: Finite Semigroups of Constant Rank, and the five B…

We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…

Large language models (LLMs) achieve strong performance by generating long chains of thought, but longer traces always introduce redundant or ineffective reasoning steps. One typical behavior is that they often perform unnecessary…

Vector addition systems are an important model in theoretical computer science and have been used for the analysis of systems in a variety of areas. Termination is a crucial property of vector addition systems and has received considerable…

We define a very general class of rational functions f:CP^1 --> CP^1 such that for every function f of this class, there exists a countable family of smooth curves \gamma_i and a critically finite hyperbolic function R such that the…

We previously showed that abstract Cuntz semigroups form a closed symmetric monoidal category. This automatically provides additional structure in the category, such as a composition and an external tensor product, for which we give…

The subordinate E-semigroups of a fixed E-semigroup are in one-to-one correspondence with local projection-valued cocycles of that semigroup. For the CCR flow we characterise these cocycles in terms of their stochastic generators, that is,…

A partial automorphism of a semigroup $S$ is any isomorphism between its subsemigroups, and the set all partial automorphisms of $S$ with respect to composition is the inverse monoid called the partial automorphism monoid of $S$. Two…

State estimation techniques for continuum robots (CRs) typically involve using computationally complex dynamic models, simplistic shape approximations, or are limited to quasi-static methods. These limitations can be sensitive to unmodelled…

We introduce and study systems of randomly coupled maps (RCM) where the relevant parameter is the degree of connectivity in the system. Global (almost-) synchronized states are found (equivalent to the synchronization observed in globally…

We consider a finite state discrete time process X. Without loss of generality the finite state space can be identified with the set of unit vectors {e1, e2, . . . , eN} with ei = (0, . . . , 0, 1, 0, . . . , 0)0 2 RN. For a Markov chain…

Reservoir computing (RC) represents a class of state-space models (SSMs) characterized by a fixed state transition mechanism (the reservoir) and a flexible readout layer that maps from the state space. It is a paradigm of computational…

In this paper we address the question of synchronizing random automata in the critical settings of almost-group automata. Group automata are automata where all letters act as permutations on the set of states, and they are not synchronizing…

Semi-automata are abstractions of electronic devices that are deterministic finite-state machines having inputs but no outputs. Generalized semiautomata are obtained from stochastic semiautomata by dropping the restrictions imposed by…

We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order…

We study algebraic properties of the semigroup $\mathscr{O\!\!I\!}_n(L)$ of finite partial order isomorphisms of the rank $\leq n$ of an infinite linearly ordered set $(L,\leqslant)$. In particular we describe its idempotents, the natural…

Dynamical systems at the edge of chaos, which have been considered as models of self-organization phenomena, are marked by their ability to perform nontrivial computations. To distinguish them from systems with limited computing power, we…

We introduce a sorting machine consisting of $k+1$ stacks in series: the first $k$ stacks can only contain elements in decreasing order from top to bottom, while the last one has the opposite restriction. This device generalizes \cite{SM},…

We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…

In previous research the importance of both Markov and semi-Markov models in manpower planning is highlighted. Maintainability of population structures for different types of personnel strategies (i.e. under control by promotion and control…

There has been a growing interest in defining models of automata enriched with time, such as finite automata extended with clocks (timed automata). In this paper, we study deterministic timed finite state machines (TFSMs), i.e., finite…