This implies that the type a," is derived from the sequent one step up.
they defined rigid grammars Gn , n C N and G such that L(an ) = c(b* a*)" and L(G) = e{a, b}* For G" the number of alternations between a sequence of a's and a sequence of b's, (both of unbounded length) is bounded.