Related papers: Commutative N-polyregular functions
While automata theory often concerns itself with regular predicates, relations corresponding to acceptance by a finite state automaton, in this article we study the regular functions, such relations which are also functions in the…
Noncommutative rational functions appeared in many contexts in system theory and control, from the theory of finite automata and formal languages to robust control and LMIs. We survey the construction of noncommutative rational functions,…
A characteristic function is a special operator-valued analytic function defined on the open unit ball of $\mathbb{C}^n$ associated with an $n$-tuple of commuting row contraction on some Hilbert space. In this paper, we continue our study…
In this paper, we study the value sets of non-permutation polynomial functions over the residue class ring $\mathbb{Z}/m\mathbb{Z}$. When $m=p^r$ is a power of some prime $p$, an upper bound is given for the size of the value set of a…
In this expository paper we describe the study of certain non-self-adjoint operator algebras, the Hardy algebras, and their representation theory. We view these algebras as algebras of (operator valued) functions on their spaces of…
We study enumeration problems for multi-operator monomials generated from one indeterminate by an associative multiplication together with finitely many unary operators. We consider four regimes, according to whether multiplication is…
In context of the Wolfram Physics Project, a certain class of abstract rewrite systems known as "multiway systems" have played an important role in discrete models of spacetime and quantum mechanics. However, as abstract mathematical…
We consider active, semi-supervised learning in an offline transductive setting. We show that a previously proposed error bound for active learning on undirected weighted graphs can be generalized by replacing graph cut with an arbitrary…
In this paper we study the coefficients of the powers of an ordinary generating function and their properties. A new class of functions based on compositions of an integer $n$ is introduced and is termed composita. We present theorems about…
The expansion of a modular graph function on a torus of modulus $\tau$ near the cusp is given by a Laurent polynomial in $y= \pi \Im (\tau)$ with coefficients that are rational multiples of single-valued multiple zeta-values, apart from the…
Let $\mathcal{P}(\Sigma^*)$ be the semiring of languages, and consider its subset $\mathcal{P}(\Sigma)$. In this paper we define the language recognized by a weighted automaton over $\mathcal{P}(\Sigma)$ and a one-letter alphabet.…
It is shown how to compute quotients efficiently in non-commutative univariate polynomial rings. This extends earlier work where efficient generic quotients were studied with a primary focus on commutative domains. Fast algorithms are given…
This work is a survey of the main results reported for the degree of extension of two models defining non-regular languages, namely the context-free grammar and the extended automaton over groups. More precisely, we recall the main results…
In this paper, we study the probability that some weighted partial sums of a random multiplicative function $f$ are positive. Applying the characteristic decomposition, we obtain that if $S$ is a non-empty subset of the multiplicative…
We present an algorithm to build an automaton from a rational expression. This approach introduces support for extended weighted expressions. Inspired by derived-term based algorithms, its core relies on a different construct, rational…
An operatorial polynomial polyhedron is a set of the form $$B_{\delta}(\mathcal{B}(\mathcal{H}))=\{X\in \mathcal{B}(\mathcal{H})^d : \Vert\delta(X)\Vert<1\}$$ where $\mathcal{B}(\mathcal{H})$ denotes the space of bounded operators on a…
We consider a non-commutative polynomial in several independent $N$-dimensional random unitary matrices, uniformly distributed over the unitary, orthogonal or symmetric groups, and assume that the coefficients are $n$-dimensional matrices.…
In Part 1 we study the spherical functions on compact symmetric pairs of arbitrary rank under a suitable multiplicity freeness assumption and additional conditions on the branching rules. The spherical functions are taking values in the…
A fundamental construction in formal language theory is the Myhill-Nerode congruence on words, whose finitedness characterizes regular language. This construction was generalized to functions from $\Sigma^*$ to $\mathbb{Z}$ by Colcombet,…
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…