Cyclic language

If A is a set of symbols, and A^* is the set of all strings built from symbols in A, then a string set L ⊆ A^* is called a formal language over the alphabet A. The language L is called cyclic if

1. ∀w∈A^*. ∀n>0. w ∈ L ⇔ wⁿ ∈ L, and
2. ∀v,w∈A^*. vw ∈ L ⇔ wv ∈ L,

where wⁿ denotes the n-fold repetition of the string w, and vw denotes the concatenation of the strings v and w.^[1]: Def.1

For example, using the alphabet A = {a, b }, the language

is cyclic, but not regular.^[1]: Exm.2 However, L is context-free, since M = { a^n₁b^n₁ a^n₂b^n₂ ... a^n_k b^n_k : n_i ≥ 0 } is, and context-free languages are closed under circular shift; L is obtained as circular shift of M.