English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Let $\gamma_{a,b}(n)$ be the number of smooth words of length $n$ over thealphabet $\{a,b\}$ with $a<b$. Say that a smooth word $w$ is \emph{left fullyextendable} (LFE) if both $aw$ and $bw$ are smooth. In this paper, we provethat for any positive number $\xi$ and positive integer $n_{0}$ such that theproportion of $b$'s is larger than $\xi$ for each LFE word of length exceeding$n_0$, there are two constants $c_{1}\,\textrm{and}\, c_{2}$ such that for eachpositive integer $n$, one has {eqnarray} c_{1}\cdot n^{\frac{\log (2b-1)}{\log(1+(a+b-2)(1-\xi))}}<\gamma_{a,b}(n)< c_2\cdot n^{\frac{\log (2b-1)}{\log(1+(a+b-2)\xi)}}. {eqnarray} In particular, taking $a=1\text{and}b=2$ in theabove inequalities arrives at Huang and Weakley's result. Moreover, for2-letter even alphabet $\{a,b\}$, there are two suitable constants $c_1,\,c_2$such that \{eqnarray} c_{1}\cdot n^{\frac{\log (2b-1)}{\log((a+b)/2)}}<\gamma_{a,b}(n)< c_2\cdot n^{\frac{\log (2b-1)}{\log((a+b)/2)}}\textit{for each positive integer $n$}.\{eqnarray}

The subword complexity of smooth words on 2-letter alphabets