Definition of bounded language:
A language L in ∑^* is said to be a bounded language if and only if
exist integer k>=1 exist strings w1,w2,...wk in ∑^* such that L is the
subset of {w1}^*.{w2}^*.{w3}^*...{wk}^*
So how to prove a language is unbounded?
