An Ogden-like iteration lemma for rational power series
- 27 Downloads
An Ogden-like iteration lemma for languages that are support of rational power series is proved; it is a generalization of Jacob's iteration lemma. The new bound we obtain is much smaller than the one of Jacob and does no more depend on the cardinality of the alphabet. The proof consists in studying how pseudo-regular matrices appear as subproducts of long products of square matrices.
KeywordsInformation System Operating System Data Structure Communication Network Information Theory
Unable to display preview. Download preview PDF.