Related papers: Finite automata and relations of multiple zeta val…
This is a book on weighted tree automata. We present the basic definitions and some of the important results in a coherent form with full proofs. The concept of weighted tree automata is part of Automata Theory and it touches the area of…
Lecture notes on tree language theory, in particular recognizable tree languages and finite state tree transformations.
We prove a new class of relations among multiple zeta values (MZV's) which contains Ohno's relation. We also give the formula for the maximal number of independent MZV's of fixed weight, under our new relations. To derive our formula for…
In this paper, we study specific families of multiple zeta values which closely relate to the linear part of Kawashima's relation. We obtain an explicit basis of these families, and investigate their interpolations to complex functions. As…
The definitions and main properties of the Ihara and Bartholdi zeta functions for infinite graphs are reviewed. The general question of the validity of a functional equation is discussed, and various possible solutions are proposed.
We study some classical identities for multiple zeta values and show that they still hold for zeta functions built on the zeros of an arbitrary function. We introduce the complementary zeta function of a system, which naturally occurs when…
We explore the theory of multiple zeta values (MZVs) and some of their $q$-generalisations. Multiple zeta values are numerical quantities that satisfy several combinatorial relations over the rationals. These relations include two…
The Ohno relation is a well-known relation among multiple zeta values. Hirose, Onozuka, Sato, and the author investigated the sum related to the Ohno relation and presented two types of new relations and five conjectural formulas. This…
We establish finite analogues of the identities known as the Aoki-Ohno relation and the Le-Murakami relation in the theory of multiple zeta values. We use an explicit form of a generating series given by Aoki and Ohno.
To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We find that there is a strong relationship between…
We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical…
We formulate an algebraic problem to find a generating system of a finite subset of an Abelian group with respect to linear relations whose coefficients are bounded by a constant, and recall MITM algorithm for the problem. As an application…
A register automaton is a finite automaton with finitely many registers ranging from an infinite alphabet. Since the valuations of registers are infinite, there are infinitely many configurations. We describe a technique to classify…
We define the zeta function of a finite category. And we propose a conjecture which states the relationship between the Euler characteristic of finite categories and the zeta function of finite categories. This conjecture is verified when…
Numerous computer systems use dynamic control and data structures of unbounded size. These data structures have often the character of trees or they can be encoded as trees with some additional pointers. This is exploited by some currently…
The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…
Multiple zeta values are real numbers defined by an infinite series generalizing values of the Riemann zeta function at positive integers. Finite truncations of this series are called multiple harmonic sums and are known to have interesting…
A Master equation has been previously obtained which allows the analytic integration of a fairly large family of functions provided that they possess simple properties. Here, the properties of this Master equation are explored, by extending…
This paper focuses linear and algebraic relations among multiple zeta values which were obtained in knot theory. It is shown that they can be derived from the associator relations, i.e. the pentagon equation and the shuffle relation.
We study Parikh automata on finite and infinite words. First we establish some results for Parikh automata on finite words. Following, we present several definitions of Parikh automata on infinite words. We consider the deterministic as…