Related papers: Finite automata and relations of multiple zeta val…
The question whether P equals NP revolves around the discrepancy between active production and mere verification by Turing machines. In this paper, we examine the analogous problem for finite transducers and automata. Every nondeterministic…
Systems of deterministic finite automata communicating by sending their states upon request are investigated, when the amount of communication is restricted. The computational power and decidability properties are studied for the case of…
In this paper, we introduce zeta values of rational convex cones, which is a generalization of cyclotomic multiple zeta values. These zeta values have integral expressions. The main theorem asserts that zeta values of cones can be expressed…
We prove a kind of integral expressions for finite multiple harmonic sums and multiple zeta-star values. Moreover, we introduce a class of multiple integrals, associated with some combinatorial data (called 2-labeled posets). This class…
By using the method of iterated integral representations of series, we establish some explicit relationships between multiple zeta values and Integrals of logarithmic functions. As applications of these relations, we show that multiple zeta…
Both topos theory and automata theory are known for their multi-faceted nature and relationship with topology, algebra, logic, and category theory. This paper aims to clarify the topos-theoretic aspects of automata theory, particularly…
We focus on multizeta values of depth two for $\mathbb{F}_q[t]$, where the ratio with another multizeta value of depth two is rational. In characteristic 2, we prove some extra relations between multizeta values of depth 2 and the same…
We develop a fully diagrammatic approach to finite-state automata, based on reinterpreting their usual state-transition graphical representation as a two-dimensional syntax of string diagrams. In this setting, we are able to provide a…
We prove the Ohno-type relation for the interpolated multiple zeta values, which was introduced first by Yamamoto. Same type results for finite multiple zeta values are also given. Moreover, these relations give the sum formula for…
Many $\mathbb{Q}$-linear relations exist between multiple zeta values, the most interesting of which are various weighted sum formulas. In this paper, we generalized these to Euler sums and some other variants of multiple zeta values by…
In this paper, we study the evaluation formulas of the interpolated multiple zeta values and the interpolated multiple $t$-values with indices involving $1,2,3$. To get these evaluations, we derive the corresponding algebraic relations in…
In this work we use a framework of finite-state automata constructions based on equivalences over words to provide new insights on the relation between well-known methods for computing the minimal deterministic automaton of a language.
In this paper, we give an overview of the various general methods in computing the zeta function of an algebraic variety defined over a finite field, with an emphasis on computing the reduction modulo $p^m$ of the zeta function of a…
We introduce hypernode automata as a new specification formalism for hyperproperties of concurrent systems. They are finite automata with nodes labeled with hypernode logic formulas and transitions labeled with actions. A hypernode logic…
Pippenger's Galois theory of finite functions and relational constraints is extended to the infinite case. The functions involved are functions of several variables on a set $A$ and taking values in a possibly different set $B$, where any…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
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…
We continue studying essential inputs of trees and automata. Strongly essential inputs of trees are introduced and studied. Various examples for application in Computer Science are shown.
We introduce certain lattice sums associated with hyperplane arrangements, which are (multiple) sums running over integers, and can be regarded as generalizations of certain linear combinations of zeta-functions of root systems. We also…
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…