Related papers: Commutative N-polyregular functions
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data omega-words). The notion of computability is defined through Turing machines with infinite inputs which can…
Regarding polynomial functions on a subset $S$ of a non-commutative ring $R$, that is, functions induced by polynomials in $R[x]$ (whose variable commutes with the coefficients), we show connections between, on one hand, sets $S$ such that…
We study real numbers defined by multidimensional automatic arrays weighted by multiplicatively independent bases. Let $a_1, \dots, a_r\geq 2$ be integers such that $\log a_1, \dots, \log a_r$ are $\mathbb Q$-linearly independent. Given…
Let $T$ be an underlying space with a non-atomic measure $\sigma$ on it. In [{\it Comm.\ Math.\ Phys.}\ {\bf 292} (2009), 99--129] the Meixner class of non-commutative generalized stochastic processes with freely independent values,…
Consider $ A^* $, the free monoid generated by the finite alphabet $A$ with the concatenation operation. Two words have the same commutative image when one is a permutation of the symbols of the other. The commutative closure of a set $ L…
In this paper, we investigate the expressive power and the algorithmic properties of weighted expressions, which define functions from finite words to integers. First, we consider a slight extension of an expression formalism, introduced by…
The classical theory of free analysis generalizes the noncommutative (nc) polynomials and rational functions, easily providing such results as an nc analogue of the Jacobian conjecture. However, the classical theory misses out on important…
We prove an implicit function theorem for non-commutative functions. We use this to show that if $p(X,Y)$ is a generic non-commuting polynomial in two variables, and $X$ is a generic matrix, then all solutions $Y$ of $p(X,Y)=0$ will commute…
Noncommutative functions are graded functions between sets of square matrices of all sizes over two vector spaces that respect direct sums and similarities. They possess very strong regularity properties (reminiscent of the regularity…
Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead. Equivalently, Alur et. al. have shown that they correspond to functions realized by deterministic Muller…
The machinery of noncommutative Schur functions provides a general tool for obtaining Schur expansions for combinatorially defined symmetric functions. We extend this approach to a wider class of symmetric functions, explore its strengths…
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data $\omega$-words). The notion of computability is defined through Turing machines with infinite inputs which can…
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…
This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables.…
One of the main applications of free probability is to show that for appropriately chosen independent copies of $d$ random matrix models, any noncommutative polynomial in these $d$ variables has a spectral distribution that converges…
We present counting reward automata-a finite state machine variant capable of modelling any reward function expressible as a formal language. Unlike previous approaches, which are limited to the expression of tasks as regular languages, our…
We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves…
Recently, in weighted automata theory the weight structure of strong bimonoids has found much interest; they form a generalization of semirings and are closely related to near-semirings studied in algebra. Here, we define polynomials over a…
We introduce a measure called width, quantifying the amount of nondeterminism in automata. Width generalises the notion of good-for-games (GFG) automata, that correspond to NFAs of width 1, and where an accepting run can be built on-the-fly…
This paper continues a systematic and comprehensive study on the structural properties of CFL functions, which are in general multi-valued partial functions computed by one-way one-head nondeterministic pushdown automata equipped with…