Results 151 to 157 of about 1,541,664 (157)

Subword complexity and Laurent series

Integers, 2011
Summary: Decimal expansions of classical constants such as \(\sqrt 2\), \(\pi\) and \(\zeta (3)\) have long been a source of difficult questions. In the case of Laurent series with coefficients in a finite field, where ``no carries appear'', the situation seems to be simplified and drastically different. In 1935, \textit{L. Carlitz} [Duke Math. J.
openaire   +2 more sources

Estimation of Entropy from Subword Complexity

2015
Subword complexity is a function that describes how many different substrings of a given length are contained in a given string. In this paper, two estimators of block entropy are proposed, based on the profile of subword complexity. The first estimator works well only for IID processes with uniform probabilities.
openaire   +1 more source

Subword complexity of the Fibonacci–Thue–Morse sequence: The proof of Dekking’s conjecture

Indagationes Mathematicae, 2021
Jeffrey Shallit
exaly  

On the subword complexity of DOL languages with a constant distribution

Information Processing Letters, 1981
A Ehrenfeucht
exaly  

Asymptotic Analysis of the kth Subword Complexity

Entropy, 2020
Mark Daniel Ward, Lida Ahmadi
exaly  

Subword complexities and iteration.

Bull. EATCS, 1985
openaire   +1 more source

SUBWORD COMPLEXITY AND PERIODICITY IN TWO OR MORE DIMENSIONS

Developments In Language Theory, 2000
openaire   +2 more sources