Abstract
In this paper we consider transformations on formal power series and extend well-known results in terms of homomorphisms to rational functions. Using these results we prove a Kleene-Schützenberger Theorem for formal power series over rational monoids. It extends a result of Sakarovitch.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berstel, J.: Transductions and Context-Free Languages. B. G. Teubner, Stuttgart (1979)
Berstel, J., Reutenauer, C.: Rational Series and Their Languages. EATCS Monographs on Theoretical Computer Science, vol. 12. Springer, Heidelberg (1988)
Borchardt, B.: The Myhill-Nerode theorem for recognizable tree series. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 146–158. Springer, Heidelberg (2003)
Bozapalidis, S.: Effective construction of the syntactic algebra of a recognizable series on trees. Acta Informatica 28(4), 351–363 (1991)
Bozapalidis, S., Alexandrakis, A.: Représentations matricielles des séries d’arbre reconnaissables. Theoretical Informatics and Applications 23(4), 449–459 (1989)
Bozapalidis, S., Louscou-Bozapalidou, O.: The rank of a formal tree power series. Theoretical Computer Science 27, 211–215 (1983)
Droste, M., Zhang, G.: On transformations of formal power series. Information and Computation 184(2), 369–383 (2003)
Droste, M., Kuske, D.: Recognizable languages in divisibility monoids. Mathematical Structures in Computer Science 11(6), 743–770 (2001)
Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, London (1974)
Fülöp, Z., Vogler, H.: Weighted tree automata and tree series transducers. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. EATCS Monographs on Theoretical Computer Science, ch. 9. Springer, Heidelberg (2009)
Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, vol. 5. Springer, Heidelberg (1986)
Kuske, D.: Contributions to a Trace Theory beyond Mazurkiewicz Traces. PhD Thesis, Technische Universität Dresden (2000)
Lang, S.: Algebra. Springer, Heidelberg (2002)
Pelletier, M., Sakarovitch, J.: Easy multiplications II. Extensions of rational semigroups. Information and Computation 88(1), 18–59 (1990)
Reutenauer, C.: Séries formelles et algèbres syntactiques. Journal of Algebra 66, 448–483 (1980)
Sakarovitch, J.: Easy multiplications I. The realm of Kleene’s theorem. Information and Computation 74(3), 173–197 (1987)
Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)
Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer, Heidelberg (1978)
Schützenberger, M.: On the definition of a family of automata. Information and Control 4, 245–270 (1961)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fichtner, I., Mathissen, C. (2011). Rational Transformations and a Kleene Theorem for Power Series over Rational Monoids. In: Kuich, W., Rahonis, G. (eds) Algebraic Foundations in Computer Science. Lecture Notes in Computer Science, vol 7020. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24897-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-24897-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24896-2
Online ISBN: 978-3-642-24897-9
eBook Packages: Computer ScienceComputer Science (R0)