Related papers: Commutative N-polyregular functions
This paper connects the classes of weighted alternating finite automata (WAFA), weighted finite tree automata (WFTA), and polynomial automata (PA). First, we investigate the use of trees in the run semantics for weighted alternating…
We show that weighted automata over the field of two elements can be exponentially more compact than non-deterministic finite state automata. To show this, we combine ideas from automata theory and communication complexity. However,…
Weighted finite automata (WFA) can expressively model functions defined over strings but are inherently linear models. Given the recent successes of nonlinear models in machine learning, it is natural to wonder whether ex-tending WFA to the…
This article answers the question of V.M. Buchstaber about the growth function of a particular $n$-valued group. This question is closely related to discrete integrable systems. In this paper, we will find a formula for the growth function…
We consider the problem of {\em restructuring} compressed texts without explicit decompression. We present algorithms which allow conversions from compressed representations of a string $T$ produced by any grammar-based compression…
The growth function is the generating function for sizes of spheres around the identity in Cayley graphs of groups. We present a novel method to calculate growth functions for automatic groups with normal form recognizing automata that…
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages $L$ that assign to each word $w$ a real number $L(w)$. In the case of infinite words, the value of a run is…
Transformers trained on huge text corpora exhibit a remarkable set of capabilities, e.g., performing basic arithmetic. Given the inherent compositional nature of language, one can expect the model to learn to compose these capabilities,…
Polyregular functions are the class of string-to-string functions definable by pebble transducers, an extension of finite-state automata with outputs and multiple two-way reading heads (pebbles) with a stack discipline. If a polyregular…
We introduce a basis of rational polynomial-like functions $P_0,\ldots,P_{n-1}$ for the free module of functions $Z/nZ\to Z/mZ$. We then characterize the subfamily of congruence preserving functions as the set of linear combinations of the…
A word-to-word function is continuous for a class of languages~$\mathcal{V}$ if its inverse maps $\mathcal{V}$_languages to~$\mathcal{V}$. This notion provides a basis for an algebraic study of transducers, and was integral to the…
Automata networks are mappings of the form f : Q Z $\rightarrow$ Q Z , where Q is a finite alphabet and Z is a set of entities; they generalise Cellular Automata and Boolean networks. An update schedule dictates when each entity updates its…
A new class of distributional transformations is introduced, characterized by equations relating function weighted expectations of test functions on a given distribution to expectations of the transformed distribution on the test function's…
We discuss non commutative functions, which naturally arise when dealing with functions of more than one matrix variable.
A Rota-Baxter operator defined on the polynomial algebra is called monomial if it maps each monomial to a monomial with some coefficient. We classify monomial Rota-Baxter operators defined on the algebra of polynomials in one variable…
We give a new proof that bounded non-commutative functions on polynomial polyhedra can be represented by a realization formula, a generalization of the transfer function realization formula for bounded analytic functions on the unit disk.
Nested weighted automata (NWA) present a robust and convenient automata-theoretic formalism for quantitative specifications. Previous works have considered NWA that processed input words only in the forward direction. It is natural to allow…
The Kleene theorem establishes a fundamental link between automata and expressions over the free monoid. Numerous generalisations of this result exist in the literature. Lifting this result to a weighted setting has been widely studied.…
Rota-Baxter operators present a natural generalisation of integration by parts formula for the integral operator. In 2015, Zheng, Guo, and Rosenkranz conjectured that every injective Rota-Baxter operator of weight zero on the polynomial…
In this paper, we give a Nivat-like characterization for weighted alternating automata over commutative semirings (WAFA). To this purpose we prove that weighted alternating can be characterized as the concatenation of weighted finite tree…