Related papers: Weighted omega-Restricted One Counter Automata
Motivated by a question of Rota, this paper studies the relationship between Rota--Baxter algebras and symmetric related functions. The starting point is the fact that the space of quasi-symmetric functions is spanned by monomial…
Motivated by the randomized generation of slowly synchronizing automata, we study automata made of permutation letters and a merging letter of rank $ n\!-\!1 $. We present a constructive randomized procedure to generate synchronizing…
In the last years renewed investigation of operator precedence languages (OPL) led to discover important properties thereof: OPL are closed with respect to all major operations, are characterized, besides the original grammar family, in…
Finite-state automata are a very effective tool in natural language processing. However, in a variety of applications and especially in speech precessing, it is necessary to consider more general machines in which arcs are assigned weights…
Let $M(1)$ be the vertex operator algebra with the Virasoro element $\omega$ associated to the Heisenberg algebra of rank $1$ and let $M(1)^{+}$ be the subalgebra of $M(1)$ consisting of the fixed points of an automorphism of $M(1)$ of…
A lower time bound $\Omega(\min(\nu(x), n-\nu(x))$ for counting the number of ones in a binary input word $x$ of length $n$ is presented, where $\nu(x)$ is the number of ones. The operations available are increment, decrement, bit-wise…
We introduce a logic to express structural properties of automata with string inputs and, possibly, outputs in some monoid. In this logic, the set of predicates talking about the output values is parametric, and we provide sufficient…
The partition functions of refined topological strings(A-models) are computed, which give rise to the circle-compactified five-dimensional supersymmetric linear quiver gauge theories in generic (not necessarily self-dual) Omega backgrounds.…
The present work looks at semiautomatic rings with automatic addition and comparisons which are dense subrings of the real numbers and asks how these can be used to represent geometric objects such that certain operations and…
We study the state complexity of regular operations in the class of ideal languages. A language L over an alphabet Sigma is a right (left) ideal if it satisfies L = L Sigma* (L = Sigma* L). It is a two-sided ideal if L = Sigma* L Sigma *,…
This thesis studies the single-use restriction for register automata and transducers over infinite alphabets. The restriction requires that a read-access to a register should have the side effect of destroying its contents. This constraint…
"Quantitative languages are extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions that assign to each infinite path the long-run average of the…
We introduce homing vector automata, which are finite automata augmented by a vector that is multiplied at each step by a matrix determined by the current transition, and have to return the vector to its original setting in order to accept…
An algebraic structure is said to be congruence permutable if its arbitrary congruences $\alpha$ and $\beta$ satisfy the equation $\alpha \circ \beta =\beta \circ \alpha$, where $\circ$ denotes the usual composition of binary relations. For…
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…
Improving the previously known best bound, we show that any recursively enumerable language can be generated with a non-returning parallel communicating (PC) grammar system having six context-free components. We also present a non-returning…
We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…
A code is said to be two-weight if the non-zero codewords have only two different a weight w1 and w2. Two-weight codes are closely related to strongly regular graphs. In this paper. It is shown that a consta-cyclic code of composite length…
We consider a general class of decision problems concerning formal languages, called ``(one-dimensional) unboundedness predicates'', for automata that feature reversal-bounded counters (RBCA). We show that each problem in this class reduces…
Let us consider a linear control system \Sigma on a connected Lie group G. It is known that the accessibility set A from the identity e is in general not a semigroup. In this article we associate a new algebraic object S to \Sigma which…