Y. Huang

most citedThe subword complexity of smooth words on 2-letter alphabets

1 citations · 2 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2010★ 1 cited

The subword complexity of smooth words on 2-letter alphabets

Yun Bao Huang

Let $γ_{a, b} (n)$ be the number of smooth words of length $n$ over the alphabet ${a, b}$ with $a < b$ . Say that a smooth word $w$ is \emph{left fully extendable} (LFE) if both $a w$ a…

math.CO2010

Maximal right smooth extension chains

Yun Bao Huang

If $w = uα$ for $α \in Σ = {1, 2}$ and $u \in Σ^{*}$ , then $w$ is said to be a \textit{simple right extension}of $u$ and denoted by $u ≺ w$ . Let $k$ be a positive integer and $P^{k} (ε)$ …

cs.FL2010

Smooth infinite words over $n$ -letter alphabets having same remainder when divided by $n$

Yun Bao Huang

Brlek et al. (2008) studied smooth infinite words and established some results on letter frequency, recurrence, reversal and complementation for 2-letter alphabets having same pari…

math.CO2009★ 1 cited

The powers of smooth words over arbitrary 2-letter alphabets

Yunbao Huang

Carpi (1993) and Lepisto (1994) proved independently that smooth words are cube-free for the alphabet {1, 2}, but nothing is known on whether for the other 2-letter alphabets, smoo…

The subword complexity of smooth words on 2-letter alphabets

Maximal right smooth extension chains

Smooth infinite words over n-letter alphabets having same remainder when divided by n

The powers of smooth words over arbitrary 2-letter alphabets

Smooth infinite words over $n$ -letter alphabets having same remainder when divided by $n$