English
Related papers

Related papers: On normality in shifts of finite type

200 papers

We consider finite state non-deterministic but unambiguous transducers with infinite inputs and infinite outputs, and we consider the property of Borel normality of sequences of symbols. When these transducers are strongly connected, and…

Formal Languages and Automata Theory · Computer Science 2020-06-17 Olivier Carton

Let $G$ be a countable cancellative amenable semigroup and let $(F_n)$ be a (left) F{\o}lner sequence in $G$. We introduce the notion of an $(F_n)$-normal element of $\{0,1\}^G$. When $G$ = $(\mathbb N,+)$ and $F_n = \{1,2,...,n\}$, the…

Dynamical Systems · Mathematics 2020-04-13 Vitaly Bergelson , Tomasz Downarowicz , Michał Misiurewicz

In this paper we introduce and study the concept of normality degree of a finite group $G$. This quantity measures the probability of a random subgroup of $G$ to be normal. Explicit formulas are obtained for some particular classes of…

Group Theory · Mathematics 2013-12-06 Marius Tarnauceanu

An infinite binary sequence is deemed to be random if it has all definable properties that hold almost surely for the usual probability measure on the set of infinite binary sequences. There are only countably many such properties, so it…

Probability · Mathematics 2011-03-18 Peter G. Doyle

We consider input-deterministic finite state transducers with infinite inputs and infinite outputs, and we consider the property of Borel normality on infinite words. When these transducers are given by a strongly connected set of states,…

Formal Languages and Automata Theory · Computer Science 2019-04-22 Olivier Carton , Elisa Orduna

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

Formal Languages and Automata Theory · Computer Science 2016-03-01 Emmanuel Filiot , Ismaël Jecker , Christof Löding , Sarah Winter

Regular sequences are natural generalisations of fixed points of constant-length substitutions on finite alphabets, that is, of automatic sequences. Using the harmonic analysis of measures associated with substitutions as motivation, we…

Number Theory · Mathematics 2021-08-12 Michael Coons , James Evans , Neil Manibo

We develop a technique for normalization for $\infty$-type theories. The normalization property helps us to prove a coherence theorem: the initial model of a given $\infty$-type theory is $0$-truncated. The coherence theorem justifies…

Logic · Mathematics 2022-12-23 Taichi Uemura

We prove that for $1<c<4/3$ the subsequence of the Thue--Morse sequence $\mathbf t$ indexed by $\lfloor n^c\rfloor$ defines a normal sequence, that is, each finite sequence $(\varepsilon_0,\ldots,\varepsilon_{T-1})\in \{0,1\}^T$ occurs as a…

Number Theory · Mathematics 2017-07-18 Lukas Spiegelhofer

In the setting of nonstandard analysis we introduce the notion of flexible sequence. The terms of flexible sequences are external numbers. These are a sort of analogue for the classical \emph{O$ (\cdot ) $} and \emph{o$ (\cdot ) $} notation…

Logic · Mathematics 2019-09-17 Bruno Dinis , Tran Van Nam , Imme van den Berg

The predictability of a sequence is defined as the asymptotic performance of the best performing predictor in a given class. The value of the predictability of a sequence will in general depend on the choice of this predictor class. The…

Statistics Theory · Mathematics 2009-04-15 Finn Macleod , Alexei Pokrovskii , Dima Rachinskii

The notion of a normal bit sequence was introduced by Borel in 1909; it was the first definition of an individual random object. Normality is a weak notion of randomness requiring only that all $2^n$ factors (substrings) of arbitrary…

Information Theory · Computer Science 2025-10-07 Alexander Shen

A pattern of a sequence is a sequence of integer indices with each index describing the order of first occurrence of the respective symbol in the original sequence. In a recent paper, tight general bounds on the block entropy of patterns of…

Information Theory · Computer Science 2007-11-15 Gil I. Shamir

The aim of this paper is to provide complementary quantitative extensions of two results of H.S. Shapiro on the time-frequency concentration of orthonormal sequences in $L^2 (\R)$. More precisely, Shapiro proved that if the elements of an…

Classical Analysis and ODEs · Mathematics 2007-07-11 Philippe Jaming , Alexander M. Powell

This paper considers the relative frequencies of distinct types of individuals in multitype branching processes. We prove that the frequencies are asymptotically multivariate normal when the initial number of ancestors is large and the time…

Probability · Mathematics 2009-03-02 Andrei Y. Yakovlev , Nikolay M. Yanev

Randomness (in the sense of being generated in an IID fashion) and exchangeability are standard assumptions in nonparametric statistics and machine learning, and relations between them have been a popular topic of research. This short paper…

Statistics Theory · Mathematics 2026-01-21 Vladimir Vovk

We first compare several algebraic notions of normality, from a categorical viewpoint. Then we introduce an intrinsic description of Higgins' commutator for ideal-determined categories, and we define a new notion of normality in terms of…

Category Theory · Mathematics 2010-02-09 Sandra Mantovani , Giuseppe Metere

Let $X$ be a finite set such that $|X|=n$. Let $\trans$ and $\sym$ denote respectively the transformation monoid and the symmetric group on $n$ points. Given $a\in \trans\setminus \sym$, we say that a group $G\leq \sym$ is $a$-normalizing…

Group Theory · Mathematics 2012-10-05 João Araújo , Peter J. Cameron , James Mitchell , Max Neunhöffer

A transient stochastic process is considered strongly transient if conditioned on returning to the starting location, the expected time it takes to return the the starting location is finite. We characterize strong transience for a…

Probability · Mathematics 2016-06-14 Jonathon Peterson

There are many randomness notions. On the classical account, many of them are about whether a given infinite binary sequence is random for some given probability. If so, this probability turns out to be the same for all these notions, so…

Probability · Mathematics 2021-07-19 Floris Persiau , Jasper De Bock , Gert de Cooman
‹ Prev 1 2 3 10 Next ›