  Nonterminal complexity of a context-free language is the smallest possible
number of nonterminals in its generating grammar. While in general case
nonterminal complexity computation problem is unsolvable, it can be computed
for different families of regular languages. In this paper we study nonterminal
complexity of some families of infinite regular languages.
