On counting functions and slenderness of languages

Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar

We study counting-regular languages -- these are languages $L$ for which there is a regular language $L^{\prime }$ such that the number of strings of length $n$ in $L$ and $L^{\prime }$ are the same…