Summary
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berstel, J.: Transductions and context free languages. Stuttgart: Teubner 1979
Boasson, L.: Private communication
Bourbaki, N.: Algèbre, chapitre 3 (algèbre multilinéaire) §7 n∘ 3. Paris: Hermann 1958
Eilenberg, S.: Automata, languages and machines, vol. A. New York: Academic Press 1974
Jacob, G.: Un théoreme de factorisation des produits d'endomorphismes. J. Algebra, (in press 1979)
Ogden, W.: A helpful result for proving inherent ambiguity. Math. System Theory 2, 191–194 (1968)
Ranum, A.: The group-membership of singular matrices. Amer. J. Math. 31, 18–41 (1909)
Schützenberger, M.P.: On a special class of recurrent events. Ann. of Math. 32, 1201–1213 (1961)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Reutenauer, C. An Ogden-like iteration lemma for rational power series. Acta Informatica 13, 189–197 (1980). https://doi.org/10.1007/BF00263993
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF00263993