Related papers: Negative bases and automata
The classical subset construction for non-deterministic automata can be generalized to other side-effects captured by a monad. The key insight is that both the state space of the determinized automaton and its semantics---languages over an…
The measured $ft$-values for superallowed $0^{+} \to 0^{+}$ nuclear $\beta$-decay can be used to obtain the value of the vector coupling constant and thus to test the unitarity of the Cabibbo-Kobayashi-Maskawa matrix. An essential…
We count the number of all Rota-Baxter operators on a finite direct sum $A = F\oplus F\oplus \ldots \oplus F$ of fields and count all of them up to conjugation with an automorphism. We also study Rota-Baxter operators on $A$ corresponding…
We introduce the concept of negative coefficients in various number-based systems, with a focus on decimal and binary systems. We demonstrate that every binary number can be transformed into a sparse form, significantly enhancing…
We study a categorical generalisation of tree automata, as $\Sigma$-algebras for a fixed endofunctor $\Sigma$ endowed with initial and final states. Under mild assumptions about the base category, we present a general minimisation algorithm…
The dynamical evolution of a recently introduced one dimensional model in \cite{biswas-sen} (henceforth referred to as model I), has been made stochastic by introducing a parameter $\beta$ such that $\beta =0$ corresponds to the Ising model…
In this paper we study the set of digit frequencies that are realised by elements of the set of $\beta$-expansions. The main result of this paper demonstrates that as $\beta$ approaches $1,$ the set of digit frequencies that occur amongst…
The aim of this article is to present a topological tool for the study of additive basis in additive number theory. It will be proposal a metric for the set of all additive basis, in which it will be possible to study properties of some…
In this article, we propose a novel discretization method based on numerical integration for discretizing continuous systems, termed the $\alpha\beta$-approximation or Scalable Bilinear Transformation (SBT). In contrast to existing methods,…
Quantum addition circuits are considered being of two types: 1) Toffolli-adder circuits which use only classical reversible gates (CNOT and Toffoli), and 2) QFT-adder circuits based on the quantum Fourier transformation. We present the…
We consider the representational state complexity of unranked tree automata. The bottom-up computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the…
Extensions of {\omega}-automata to infinite alphabets typically rely on symbolic guards to keep the transition relation finite, and on registers or memory cells to preserve information from past symbols. Symbolic transitions alone are…
For any infinite transitive sofic shift $X$ we construct a reversible cellular automaton (i.e. an automorphism of the shift $X$) which breaks any given finite point of the subshift into a finite collection of gliders traveling into opposing…
Automata-logic connections are pillars of the theory of regular languages. Such connections are harder to obtain for transducers, but important results have been obtained recently for word-to-word transformations, showing that the three…
In this work in progress, we study the asymptotic behaviour of the $p$-quantile of the Beta distribution, i.e. the quantity $q$ defined implicitly by $\int_0^q t^{a - 1} (1 - t)^{b - 1} \text{d} t = p B (a, b)$, as a function of the first…
The concept of additive basis has been investigated in the literature for several mathematicians which works with number theorem. Recently, the concept of finitely stable additive basis was introduced. In this note we provide a…
We introduce notions of simulation between semiring-weighted automata as models of quantitative systems. Our simulations are instances of the categorical/coalgebraic notions previously studied by Hasuo---hence soundness against language…
Let $\beta>1$ be a real number and define the $\beta$-transformation on $[0,1]$ by $T_\beta:x\mapsto \beta x\bmod 1$. Further, define $$W_y(T_{\beta},\Psi):=\{x\in [0, 1]:|T_\beta^nx-y|<\Psi(n) \mbox{ for infinitely many $n$}\}$$ and…
We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…
We introduce a transformation for converting a series in a parameter, \lambda, to a series in the inverse of the parameter \lambda^{-1}. By applying the transform on simple examples, it becomes apparent that there exist relations between…