Related papers: Finite automata and relations of multiple zeta val…

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…

The Kaneko--Zagier conjecture describes a correspondence between finite multiple zeta values and symmetric multiple zeta values. Its refined version has been established by Jarossay, Rosen and Ono--Seki--Yamamoto. In this paper, we…

Probabilistic automata are an extension of nondeterministic finite automata in which transitions are annotated with probabilities. Despite its simplicity, this model is very expressive and many of the associated algorithmic questions are…

We present a new "integral=series" type identity of multiple zeta values, and show that this is equivalent in a suitable sense to the fundamental theorem of regularization. We conjecture that this identity is enough to describe all linear…

Multi-head finite automata were introduced in (Rabin, 1964) and (Rosenberg, 1966). Since that time, a vast literature on computational and descriptional complexity issues on multi-head finite automata documenting the importance of these…

A possible connection between quantum computing and Zeta functions of finite field equations is described. Inspired by the 'spectral approach' to the Riemann conjecture, the assumption is that the zeroes of such Zeta functions correspond to…

Automata over infinite alphabets have emerged as a convenient computational model for processing structures involving data, such as nonces in cryptographic protocols or data values in XML documents. We introduce active learning methods for…

Observing a multiple version of the divisor function we introduce a new zeta function which we call a multiple finite Riemann zeta function. We utilize some $q$-series identity for proving the zeta function has an Euler product and then,…

This paper generalizes Bass' work on zeta functions for uniform tree lattices. Using the theory of von Neumann algebras, machinery is developed to define the zeta function of a discrete group of automorphisms of a bounded degree tree. The…

Multiple zeta values associated with function fields with varying constant fields are dealt with simultaneously. Thakur introduced multiple zeta values in the arithmetic of positive characteristic function fields, and the definition depends…

The Ramanujan Machine project detects new expressions related to constants of interest, such as $\zeta$ function values, $\gamma$ and algebraic numbers (to name a few). In particular the project lists a number of conjectures involving even…

We discuss a few selected topics in finite temperature field theory.

We give three identities involving multiple zeta values of height one and of maximal height; an explicit formula for the height-one multiple zeta values, a regularized sum formula, and a sum formula for the multiple zeta values of maximal…

This paper presents the first step of a wider research effort to apply tree automata completion to the static analysis of functional programs. Tree Automata Completion is a family of techniques for computing or approximating the set of…

An explicit formula for the height-one multiple zeta values was proved by Kaneko and the second author. We give an alternative proof of this result and its generalization. We also prove its counterpart for the finite multiple zeta values.

This work is an example driven overview article of recent works on the connection of multiple zeta values, modular forms and q-analogues of multiple zeta values given by multiple Eisenstein series.

We determine all functional closure properties of finite $\mathbb{N}$-weighted automata, even all multivariate ones, and in particular all multivariate polynomials. We also determine all univariate closure properties in the promise setting,…

In this paper we introduce and study double tails of multiple zeta values. We show, in particular, that they satisfy certain recurrence relations and deduce from this a generalization of Euler's classical formula…

The multiple zeta values (MZV) are a set of real numbers with a beautiful structure as an algebra over the rational numbers. They are related to maybe the most important conjecture on mathematics today, the Riemann hypothesis. In this paper…

A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize such automata in terms of graphs…