Related papers: Automatic supermartingales acting on sequences
The superextension $\lambda(X)$ of a set $X$ consists of all maximal linked families on $X$. Any associative binary operation $*: X\times X \to X$ can be extended to an associative binary operation $*:…
We study two different types of (maximal) almost disjoint families: very mad families and (maximal) cofinitary groups. For the very mad families we prove the basic existence results. We prove that MA implies there exist many pairwise…
Infinite time Turing machines extend the classical Turing machine concept to transfinite ordinal time, thereby providing a natural model of infinitary computability that sheds light on the power and limitations of supertask algorithms.
Very recently, in [Das et al., J. Lond. Math. Soc., 2025], statistically characterized subgroups were studied for certain classes of non-arithmetic sequences. Subsequently, in [Das et al., Bull. Sci. Math., 2025], characterized subgroups…
We build on a fine-grained analysis of session-based interaction as provided by the linear logic typing disciplines to introduce the SAM, an abstract machine for mechanically executing session-typed processes. A remarkable feature of the…
We make a start on one of George McNulty's Dozen Easy Problems: "Which finite automatic algebras are dualizable?" We give some necessary and some sufficient conditions for dualizability. For example, we prove that a finite automatic algebra…
A family $\mathcal L$ of subsets of a set $X$ is called linked if $A\cap B\ne\emptyset$ for any $A,B\in\mathcal L$. A linked family $\mathcal M$ of subsets of $X$ is maximal linked if $\mathcal M$ coincides with each linked family $\mathcal…
We characterize asymptotic collective behaviour of rectangular random matrices, the sizes of which tend to infinity at different rates: when embedded in a space of larger square matrices, independent rectangular random matrices are…
Motivated by the theory of unitary representations of finite dimensional Lie supergroups, we describe those Lie superalgebras which have a faithful finite dimensional unitary representation. We call these Lie superalgebras unitary. This is…
Supertagging is conventionally regarded as an important task for combinatory categorial grammar (CCG) parsing, where effective modeling of contextual information is highly important to this task. However, existing studies have made limited…
Cellular automata, CA for short are continuous maps defined on the set of configurations over a finite alphabet A that commutes with the shift. They are characterized by the existence of local function which determine by local behavior the…
The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…
In this paper, we construct a new unpredictable function. Our approach is based on adapting the concept of symbolic dynamics to introduce a map on the space of infinite sequences generated by the discrete distribution. We show that there…
We calculate within a semiclassical approximation the autocorrelation function of cross sections. The starting point is the semiclassical expression for the diagonal matrix elements of an operator. For general operators with a smooth…
We introduce the notion of hyperfiniteness for permutation actions of countable groups on countable sets and give a geometric and analytic characterization, similar to the known characterizations for amenable actions. We also answer a…
After reviewing automaton semigroups, we introduce Cayley Automata and the corresponding Cayley Automaton semigroups. We investigate which semigroups are isomorphic to their Cayley Automaton semigroup and give some results for special…
In this paper we combine the algebraic properties of Mealy machines generating self-similar groups and the combinatorial properties of the corresponding deterministic finite automata (DFA). In particular, we relate bounded automata to…
We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this…
Invariance properties of semimartingales on Lie groups under a family of random transformations are defined and investigated, generalizing the random rotations of the Brownian motion. A necessary and sufficient explicit condition…
In this paper we introduce the concept of conic martingales}. This class refers to stochastic processes having the martingale property, but that evolve within given (possibly time-dependent) boundaries. We first review some results about…