Abstract
We show that the support of a recognizable series over a zero-sum free, commutative semiring is a recognizable language. We also give a sufficient and necessary condition for the existence of an effective transformation of a weighted automaton recognizing a series S over a zero-sum free, commutative semiring into an automaton recognizing the support of S.
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, New York (1984)
Berstel, J., Reutenauer, C.: Noncommutative rational series with applications (prelimary electronic version ) (2009), http://www-igm.univ-mlv.fr/~berstel/
Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2009)
Kreuzer, M., Robbiano, L.: Computational Commutative Algebra 1. Springer, Heidelberg (2008)
Kuich, W.: Semirings and formal power series. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Word, Language, Grammar, vol. 1, pp. 609–677. Springer, Berlin (1997)
Reutenauer, C.: A survey on noncommutative rational series. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 24, 159–169 (1996)
Sakarovitch, J.: Rational and recognisable power series. In: [4], ch. 4 (2009)
Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs on Computer Science. Springer, New York (1978)
Wang, H.: On rational series and rational languages. Theoretical Computer Science 205(1-2), 329–336 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kirsten, D. (2009). The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable. In: Diekert, V., Nowotka, D. (eds) Developments in Language Theory. DLT 2009. Lecture Notes in Computer Science, vol 5583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02737-6_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-02737-6_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02736-9
Online ISBN: 978-3-642-02737-6
eBook Packages: Computer ScienceComputer Science (R0)