|
Regular languages with polynomial growth in the number of words
A. S. Strogalov
Abstract:
An important feature of regular sets is the functions that describe the distribution of the number of words of given length in them, which are called the growth functions of these sets. We establish that any nonnegative integer-valued polynomial can be the growth function of a regular set.
Received: 01.02.1990
Citation:
A. S. Strogalov, “Regular languages with polynomial growth in the number of words”, Diskr. Mat., 2:3 (1990), 145–152; Discrete Math. Appl., 2:3 (1992), 285–292
Linking options:
https://www.mathnet.ru/eng/dm878 https://www.mathnet.ru/eng/dm/v2/i3/p145
|
Statistics & downloads: |
Abstract page: | 334 | Full-text PDF : | 118 | First page: | 1 |
|