Regular frequency computations

Conversely, for 2m⩽n, the class of languages (m,n)-recognizable by deterministic finite automata is uncountable for a two-letter alphabet. When restricted to a one-letter alphabet, then every (m,n)-recognizable language is regular. This was also shown by Kinber. We give a new and more direct proof for this result.