In particular, real-time counting languages cut across the traditional Chomsky hierarchy: real-time k-counter machines can recognize at least one context-free language (a n b n ), and at least one context-sensitive one (a n b n c n ).
they cannot recognize the context free language given by the grammar S → x|aSa|bSb (palindromes).