Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of\n Dekking's conjecture [PDF]
, 2020 Jeffrey Shallit
openalex +2 more sources
Eulerian entropy and non-repetitive subword complexity
Theoretical Computer Science, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
On Subword Complexity of Morphic Sequences
, 2015 We study structure of pure morphic and morphic sequences and prove the following result: the subword complexity of arbitrary morphic sequence is either $ (n^{1+1/k})$ for some $k\in\mathbb N$, or is $O(n \log n)$.
openaire +2 more sources
Crucial Words and the Complexity of Some Extremal Problems for Sets of Prohibited Words
, 2001 We introduced the notation of a set of prohibitions and give definitions of a complete set and a crucial word with respect to a given set of prohibitions.
Evdokimov, A., Kitaev, S.
core
Decidability, Complexity, and Expressiveness of First-Order Logic Over the Subword Ordering [PDF]
, 2017 Simon Halfon +3 more
openalex +1 more source
Complexity of Counting First-Order Logic for the Subword Order
, 2020 Dietrich Kuske, Christian Schwarz
openalex +2 more sources
Subword complexity and Laurent series with coefficients in a finite field [PDF]
, 2010 Alina Firicel
openalex +1 more source
On the subword complexity of iteratively generated infinite words
Discrete Applied Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the subword complexity of the fixed point of $a \rightarrow aab$, $b \rightarrow b$, and generalizations [PDF]
, 2016 Jean‐Paul Allouche, Jeffrey Shallit
openalex +1 more source
On the subword complexity of Thue–Morse polynomial extractions
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source