Counting Descriptions- a ``new'' complexity class Computational Complexity, 28 Mar 2013 Let nĪ(w) is the number of Ī's in w. We often ask our students about languages like { w | na(w) = 2nb(w) } (CFL but not REG).