Related papers: Finite automata and relations of multiple zeta val…
In this paper, we introduce the method of adding additional factors and a parameter to multiple zeta values and prove some generalizations of the duality theorem and several relations among multiple zeta values. In particular, we are able…
In this paper, we prove that certain parametrized multiple series which generalize multiple zeta values satisfy the same relation as Ohno's relation for multiple zeta values. This is a parametrized generalization of Ohno's relation for…
In this paper, we give a formula that connects two variants of multiple zeta values; multitangent functions and symmetric multiple zeta values. As an application of this formula, we give two results. First, we prove Bouillot's conjecture on…
We find an application in quantum finite automata for the ideas and results of [JL21] and [JL22]. We reformulate quantum finite automata with multiple-time measurements using the algebraic notion of near-ring. This gives a unified…
In the classic problem of sequence prediction, a predictor receives a sequence of values from an emitter and tries to guess the next value before it appears. The predictor masters the emitter if there is a point after which all of the…
This note is a compilation of related research on modular relations for multiple zeta values. Roughly speaking, modular relations are (homogeneous) linear relations of multiple zeta values of fixed weight whose coefficients are `originated'…
In this paper we extend the Tanaka finiteness theorem and inequality for the number of symmetries to arbitrary distributions (differential systems) and provide several applications.
Weighted automata are non-deterministic automata where the transitions are equipped with weights. They can model quantitative aspects of systems like costs or energy consumption. The value of a run can be computed, for example, as the…
We develop a group graded Morita theory over a G-graded G-acted algebra, where G is a finite group.
Two new classes of finite automata, called General hexagonal Boustrophedon finite automata and General hexagonal returning finite automata operating on hexagonal grids, are introduced and analyzed. The work establishes the theoretical…
The cyclic relation obtained in a study by Hirose, Murakami, and the first-named author, is a wide class of relations, which includes the well-known cyclic sum formula for multiple zeta and zeta-star values, and the derivation relation for…
This paper describes a method for converting formulas in finite propositional linear-time temporal logic (Finite LTL) into finite-state automata whose languages are the models of the given formula. Finite LTL differs from traditional LTL in…
In the last few years there have been rapid developments in SMT solving for finite fields. These include new decision procedures, new implementations of SMT theory solvers, and new software verifiers that rely on SMT solving for finite…
We describe in terms of automata theory the automatic actions with post-critically finite limit space. We prove that these actions are precisely the actions by bounded automata and that any self-similar action by bounded automata is…
Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automata address a demand for a model over large or infinite…
Finite automata (FA) are a fundamental computational abstraction that is widely used in practice for various tasks in computer science, linguistics, biology, electrical engineering, and artificial intelligence. Given an input word, an FA…
The sum formula for finite and symmetric multiple zeta values, established by Wakabayashi and the authors, implies that if the weight and depth are fixed and the specified component is required to be more than one, then the values sum up to…
Various product and sum relationships are established using special functions, specifically involving Special functions. These relationships are derived from formulas inspired by the finite sum that incorporates the Hurwitz-Lerch zeta…
We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register automata, which are the common generalization of weighted automata and register automata…
The $L^2$-zeta function of an infinite graph Y (defined previously in a ball around zero) has an analytic extension. For a tower of finite graphs covered by Y, the normalized zeta functions of the finite graphs converge to the $L^2$-zeta…