Change language
English Deutsch
Change currency
€ EUR £ GBP $ USD
Licensed Unlicensed Requires Authentication Published by De Gruyter October 9, 2009

On regular languages with polynomial growth of the number of words

  • A. S. STROGALOV
From the journal Discrete Mathematics and Applications
https://doi.org/10.1515/dma.1992.2.3.285
Published Online: 2009-10-09
Published in Print: 1992

Walter de Gruyter

From the journal
Discrete Mathematics and Applications
Discrete Mathematics and Applications
Volume 2 Issue 3

Journal and Issue

Articles in the same Issue

On perfect codes in deletion and insertion metric
On the complexity of approximate computation of real numbers by schemes and formulae in different rational bases
On regular languages with polynomial growth of the number of words
Upper bounds for the exponents of pseudo-symmetric graphs
On the relationship between the optima of linear and integer linear programming
On the complexity of sorting problem for a Boolean algebra
A lower bound for time complexity of the integer problem on uniqueness of elements
On sufficient conditions for asymptotic normality of decomposable statistics in a non-homogeneous allocation scheme
Sampling sums of dependent random variables, mixtures of infinitely divisible laws and branching random processes
Downloaded on 27.4.2024 from https://www.degruyter.com/document/doi/10.1515/dma.1992.2.3.285/html
Scroll to top button