Related papers: Non-Archimedean dynamics of the complex shift
If A is a finite alphabet, Z^D is a D-dimensional lattice, U is a subset of Z^D, and mu_U is a probability measure on A^U that ``looks like'' the marginal projection of a stationary random field on A^(Z^D), then can we ``extend'' mu_U to…
A data word is a sequence of pairs of a letter from a finite alphabet and an element from an infinite set, where the latter can only be compared for equality. Safety one-way alternating automata with one register on infinite data words are…
Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of model checking a fixed monadic second-order formula over evolving subgraphs of a fixed maximal…
We introduce a new type of shift dynamics as an extended model of symbolic dynamics, and investigate the characteristics of shift spaces from the viewpoints of both dynamics and computation. This shift dynamics is called a functional shift…
The automatic complexity of a finite word (string) is an analogue for finite automata of Sipser's distinguishing complexity (1983) and was introduced by Shallit and Wang (2001). For a finite alphabet $\Sigma$ of at least two elements, we…
We propose a method to improve traditional character-based PPM text compression algorithms. Consider a text file as a sequence of alternating words and non-words, the basic idea of our algorithm is to encode non-words and prefixes of words…
A morphic word is obtained by iterating a morphism to generate an infinite word, and then applying a coding. We characterize morphic words with polynomial growth in terms of a new type of infinite word called a $\textit{zigzag word}$. A…
Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…
Using periodic points we study a notion of entropy with values in the p-adic numbers. This is done for actions of countable discrete residually finite groups $\Gamma$. For suitable $\Gamma = \mathbb{Z}^d$-actions we obtain p-adic analogues…
The Parikh finite word automaton (PA) was introduced and studied by Klaedtke and Ruess in 2003. Natural variants of the PA arise from viewing a PA equivalently as an automaton that keeps a count of its transitions and semilinearly…
We study approximation schemes for shift spaces over a finite alphabet using (pseudo)metrics connected to Ornstein's $\bar{d}$ metric. This leads to a class of shift spaces we call $\bar{d}$-approachable. A shift space…
An index for a finite automaton is a powerful data structure that supports locating paths labeled with a query pattern, thus solving pattern matching on the underlying regular language. In this paper, we solve the long-standing problem of…
Parikh-collinear morphisms have the property that all the Parikh vectors of the images of letters are collinear, i.e., the associated adjacency matrix has rank 1. In the conference DLT-WORDS 2023 we showed that fixed points of…
This paper describes sufficient conditions to ensure the correct ergodicity of the Adaptive Metropolis (AM) algorithm of Haario, Saksman and Tamminen [Bernoulli 7 (2001) 223--242] for target distributions with a noncompact support. The…
We give lower bounds for the size of linearization discs for power series over $\mathbb{C}_p$. For quadratic maps, and certain power series containing a `sufficiently large' quadratic term, we find the exact linearization disc. For finite…
Let F : V --> V be a self-morphism of a quasiprojective variety defined over a number field K and let P be a point in V(K) with infinite orbit under iteration of F. For each prime ideal p of good reduction, let m_p(F,P) be the size of the…
For upper semi-continuous potentials defined on shifts over countable alphabets, this paper ensures sufficient conditions for the existence of a maximizing measure. We resort to the concept of blur shift, introduced by T. Almeida and M.…
We study the computational and descriptional complexity of the following transformation: Given a one-counter automaton (OCA) A, construct a nondeterministic finite automaton (NFA) B that recognizes an abstraction of the language L(A): its…
We establish several new probabilistic, dynamical, dimensional and number theoretical phenomena connected with Ostrogradsky-Sierpi\'nski-Pierce expansion. First of all, we develop metric, ergodic and dimensional theories of the…
The Bopp's shifts will be generalized through symplectic formalism. A special procedure, like a "diagonalization", which drives the completely deformed symplectic matrix to the standard symplectic form was found as suggested by…