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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

If $w=u\alpha$ for $\alpha\in \Sigma=\{1,2\}$ and $u\in \Sigma^*$, then $w$is said to be a \textit{simple right extension}of $u$ and denoted by $u\precw$. Let $k$ be a positive integer and $P^k(\epsilon)$ denote the set of all$C^\infty$-words of height $k$. Set $u_{1},\,u_{2},..., u_{m}\inP^{k}(\epsilon)$, if $u_{1}\prec u_{2}\prec ...\prec u_{m}$ and there is noelement $v$ of $P^{k}(\epsilon)$ such that $v\prec u_{1}\text{or} u_{m}\precv$, then $u_{1}\prec u_{2}\prec...\prec u_{m}$ is said to be a \textit{maximalright smooth extension (MRSE) chains}of height $k$. In this paper, we show that\textit{MRSE} chains of height $k$ constitutes a partition of smooth words ofheight $k$ and give the formula of the number of \textit{MRSE} chains of height$k$ for each positive integer $k$. Moreover, since there exist the minimalheight $h_1$ and maximal height $h_2$ of smooth words of length $n$ for eachpositive integer $n$, we find that \textit{MRSE} chains of heights $h_1-1$ and$h_2+1$ are good candidates to be used to establish the lower and upper boundsof the number of smooth words of length $n$ respectively, which is simpler andmore intuitionistic than the previous methods.

Maximal right smooth extension chains