Abstract
The notion of rank of a language with respect to an independence alphabet is generalized from concatenations of two words to an arbitrary fixed number of words. It is proved that in the case of free commutative monoids, as well as in the more general case of direct products of free monoids, sequences of ranks of regular languages are exactly non-decreasing sequences that are eventually constant. On the other hand, by uncovering a relationship between rank sequences of regular languages and rational series over the min-plus semiring, it is shown that already for free products of free commutative monoids, rank sequences need not be eventually periodic.
This work was supported by grant 15-02862S of the Czech Science Foundation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Berstel, J., Reutenauer, C.: Noncommutative Rational Series with Applications. Cambridge University Press, Cambridge (2011)
Diekert, V., Métivier, Y.: Partial commutation and traces. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Beyond Words, vol. 3, pp. 457–533. Springer, Berlin (1997)
Droste, M., Kuske, D.: Recognizable languages in divisibility monoids. Math. Struct. Comput. Sci. 11(6), 743–770 (2001)
Hashiguchi, K.: Recognizable closures and submonoids of free partially commutative monoids. Theoret. Comput. Sci. 86(2), 233–241 (1991)
Klunder, B., Ochmański, E., Stawikowska, K.: On star-connected flat languages. Fund. Inform. 67(1–3), 93–105 (2005)
Leung, H.: An algebraic method for solving decision problems in finite automata theory. Ph.D. thesis, Pennsylvania State University (1987)
Ochmański, E., Wacrenier, P.-A.: On regular compatibility of semi-commutations. In: Lingas, A., Karlsson, R., Carlsson, S. (eds.) ICALP 1993. LNCS, vol. 700, pp. 445–456. Springer, Heidelberg (1993). doi:10.1007/3-540-56939-1_93
Sakarovitch, J.: The “last” decision problem for rational trace languages. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 460–473. Springer, Berlin (1992)
Simon, I.: The nondeterministic complexity of a finite automaton. In: Lothaire, M. (ed.) Mots, Mélanges offerts à M.-P. Schützenberger, pp. 384–400. Hermès, Paris (1990)
Acknowledgments
We are grateful to Jacques Sakarovitch and Sylvain Lombardy for pointing us to the result of Simon [9].
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Kunc, M., Meitner, J. (2017). The Generalized Rank of Trace Languages. In: Charlier, É., Leroy, J., Rigo, M. (eds) Developments in Language Theory. DLT 2017. Lecture Notes in Computer Science(), vol 10396. Springer, Cham. https://doi.org/10.1007/978-3-319-62809-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-62809-7_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62808-0
Online ISBN: 978-3-319-62809-7
eBook Packages: Computer ScienceComputer Science (R0)