English
Related papers

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

200 papers

We conceive finite automata as dynamical systems on discontinuum and investigate their factors. Factors of finite automata include many well-known simple dynamical systems, e.g. hyperbolic systems and systems with finite attractors. In the…

chao-dyn · Physics 2008-02-03 Petr Kurka

We associate motivic zeta functions to a large class of infinite dimensional Lie algebras

Representation Theory · Mathematics 2007-12-06 M. du Sautoy , F. Loeser

The axioms of iteration theories, or iteration categories, capture the equational properties of fixed point operations in several computationally significant categories. Iteration categories may be axiomatized by the Conway identities and…

Logic in Computer Science · Computer Science 2015-04-15 Zoltan Esik

We combine the powerful method of Wilf-Zeilberger pairs with systematic theory of multiple zeta values to prove a large number of series identities due to Z.W. Sun, many of them have been long standing conjectures.

Number Theory · Mathematics 2024-12-25 Kam Cheong Au

In this paper we define a continuous version of multiple zeta functions. They can be analytically continued to meromorphic functions on $\mathbb{C}^r$ with only simple poles at some special hyperplanes. The evaluations of these functions at…

Number Theory · Mathematics 2023-02-24 Jiangtao Li

The sum formula is a well known relation in the field of the multiple zeta values. In this paper, we present its generalization for the Euler-Zagier multiple zeta function.

Number Theory · Mathematics 2021-07-28 Minoru Hirose , Hideki Murahara , Tomokazu Onozuka

Hereditarily finite (HF) set theory provides a standard universe of sets, but with no infinite sets. Its utility is demonstrated through a formalisation of the theory of regular languages and finite automata, including the Myhill-Nerode…

Formal Languages and Automata Theory · Computer Science 2015-05-08 Lawrence C. Paulson

Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…

Formal Languages and Automata Theory · Computer Science 2017-03-01 Jörg Endrullis , Jeffrey Shallit , Tim Smith

We prove an easy but interesting result about the linear independence of multiple zeta values of different weights.

Number Theory · Mathematics 2007-05-23 Sergey Zlobin

We introduce an algebraic formulation of cyclic sum formulas for multiple zeta values and for multiple zeta-star values. We also present an algebraic proof of cyclic sum formulas for multiple zeta values and for multiple zeta-star values by…

Number Theory · Mathematics 2009-02-17 Tatsushi Tanaka , Noriko Wakabayashi

We define a model of advised computation by finite automata where the advice is provided on a separate tape. We consider several variants of the model where the advice is deterministic or randomized, the input tape head is allowed…

Formal Languages and Automata Theory · Computer Science 2016-03-27 Uğur Küçük , A. C. Cem Say , Abuzer Yakaryılmaz

In this paper, we define finite Carlitz multiple polylogarithms and show that every finite multiple zeta value over the rational function field $\mathbb{F}_{q}(\theta)$ is an $\mathbb{F}_{q}(\theta)$-linear combination of finite Carlitz…

Number Theory · Mathematics 2016-11-10 Chieh-Yu Chang , Yoshinori Mishiba

We study a polynomial interpolation of finite multiple zeta and zeta-star values with variable $t$, which is an analogue of interpolated multiple zeta values introduced by Yamamoto. We introduce several relations among them and, in…

Number Theory · Mathematics 2020-08-25 Hideki Murahara , Masataka Ono

This survey is intended to be a fast (and reasonably updated) reference for the theory of Stallings automata and its applications to the study of subgroups of the free group, with the main accent on algorithmic aspects. Consequently,…

Group Theory · Mathematics 2022-06-14 Jordi Delgado , Enric Ventura

In this paper we prove the equivalence of sequential, Mealy-type and Moore-type weighted finite automata with output, with respect to various semantics which are defined here.

Formal Languages and Automata Theory · Computer Science 2014-10-10 Jelena Ignjatović , Miroslav Ćirić , Zorana Jančić

We introduce an iterated integral version of (generalized) log-sine integrals (iterated log-sine integrals) and prove a relation between a multiple polylogarithm and iterated log-sine integrals. We also give a new method for obtaining…

Number Theory · Mathematics 2019-04-23 Ryota Umezawa

We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…

Formal Languages and Automata Theory · Computer Science 2019-10-17 Max Neunhöffer , Markus Pfeiffer , Nik Ruskuc

In the book we present main concepts of probabilistic automata theory.

Formal Languages and Automata Theory · Computer Science 2015-07-21 Andrew M. Mironov

We show that a duality formula for certain parametrized multiple series yields numerous relations among them. As a result, we obtain a new relation among extended multiple zeta values, which is an extension of Ohno's relation for multiple…

Number Theory · Mathematics 2023-03-28 Masahiro Igarashi

Multiple zeta values (MZVs) are real numbers which are defined by certain multiple series. Recently, many people have researched for relations among them and many relations are well known. In this paper, we get a new relation among them…

Number Theory · Mathematics 2015-12-29 Shin-ya Kadota
‹ Prev 1 4 5 6 7 8 10 Next ›