  The structures of full words and non-full for $\beta$-expansions are
completely characterized in this paper. We obtain the precise lengths of all
the maximal runs of full and non-full words among admissible words with same
order.
