Results 11 to 20 of about 8,270 (198)

Asymptotic Analysis of the kth Subword Complexity [PDF]

Entropy, 2020
Patterns within strings enable us to extract vital information regarding a string’s randomness. Understanding whether a string is random (Showing no to little repetition in patterns) or periodic (showing repetitions in patterns) are described by a ...
Lida Ahmadi, Mark Daniel Ward
doaj   +8 more sources

The Maximal Subword Complexity of Quasiperiodic Infinite Words [PDF]

Electronic Proceedings in Theoretical Computer Science, 2010
We provide an exact estimate on the maximal subword complexity for quasiperiodic infinite words. To this end we give a representation of the set of finite and of infinite words having a certain quasiperiod q via a finite language derived from q.
Ronny Polley, Ludwig Staiger
doaj   +7 more sources

On Correlation Polynomials and Subword Complexity [PDF]

Discrete Mathematics & Theoretical Computer Science, 2007
We consider words with letters from a $q-ary$ alphabet $\mathcal{A}$. The kth subword complexity of a word $w ∈\mathcal{A}^*$ is the number of distinct subwords of length $k$ that appear as contiguous subwords of $w$.
Irina Gheorghiciuc, Mark Daniel Ward
doaj   +3 more sources

The height of piecewise-testable languages and the complexity of the logic of subwords [PDF]

Logical Methods in Computer Science, 2019
The height of a piecewise-testable language $L$ is the maximum length of the words needed to define $L$ by excluding and requiring given subwords. The height of $L$ is an important descriptive complexity measure that has not yet been investigated in a ...
Prateek Karandikar, Philippe Schnoebelen
doaj   +4 more sources

The subword complexity of polynomial subsequences of the Thue–Morse sequence [PDF]

Comptes Rendus. Mathématique, 2022
Let $\mathbf{t}=(t(n))_{n\geqslant 0}$ be the Thue–Morse sequence in $0,1$. J.-P. Allouche and J. Shallit asked in 2003 whether the subword complexity of the subsequence $(t(n^2))_{n\geqslant 0}$ attains the maximal value.
Shen, Zhao
doaj   +2 more sources

Subword complexity and finite characteristic numbers [PDF]

Actes des rencontres du CIRM, 2010
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 finite characteristic numbers (Laurent series with coefficients in a finite field), where no carry-over difficulties appear, the situation seems to be simplified and drastically different.
Alina Firicel
openalex   +3 more sources

On scattered subword complexity [PDF]

, 2011
Special scattered subwords, in which the gaps are of length from a given set, are defined. The scattered subword complexity, which is the number of such scattered subwords, is computed for rainbow words.
Zoltán Kása
  +6 more sources

Subword Complexity and k-Synchronization [PDF]

, 2012
We show that the subword complexity function p_x(n), which counts the number of distinct factors of length n of a sequence x, is k-synchronized in the sense of Carpi if x is k-automatic. As an application, we generalize recent results of Goldstein. We give analogous results for the number of distinct factors of length n that are primitive words or ...
Daniel Goč, Luke Schaeffer, Jeffrey Shallit   +2 more
openalex   +4 more sources

BioSemAF-BiLSTM: a protein sequence feature extraction framework based on semantic and evolutionary information [PDF]

Frontiers in Genetics
S-sulfenylation is a critical post-translational modification that plays an important role in regulating protein function, redox signaling, and maintaining cellular homeostasis.
Zihan Zhang, Yixuan Wang
doaj   +2 more sources

Subword Complexes and Kalai's Conjecture on Reconstruction of Spheres. [PDF]

Discrete Comput Geom
Abstract A famous theorem in polytope theory states that the combinatorial type of a simplicial polytope is completely determined by its facet-ridge graph. This celebrated result was proven by Blind and Mani (Aequationes Math 34(2–3):287–297, 1987, https://doi.org/10.1007/BF01830678), via a non-constructive proof using topological tools from ...
Ceballos C, Doolittle J.
europepmc   +3 more sources