Abstract
Let I \(\subseteq\) X×X be an independence relation over a finite alphabet X and M=X*/{(ab, ba)|(a, b)teI} the associated free partially commutative monoid. The Möbius function of M is a polynomial in the ring of formal power series Z 《M》. Taking representatives we may view it as a polynomial in Z《X*》. We call it unambiguous if its formal inverse in Z《X*》 is the characteristic series over a set of representatives of M. The main result states that there is an unambiguous Möbius function of M in Z 《X*》 if and only if there is a transitive orientation of I. It is known that transitive orientations correspond exactly to finite complete semi-Thue systems S \(\subseteq\) X*×X* which define M. We obtain a one-to-one correspondence between unambiguous Möbius functions, transitive orientations and finite (normalized) complete semi-Thue systems.
Preview
Unable to display preview. Download preview PDF.
References
P. Cartier, D. Faota: Problèmes combinatoires de commutation et réarrengements; Lect. Not. in Math., No. 85 (1969)
C. Choffrut: Free partially commutative monoids; LITP-report 86/20, Université de Paris 7 (1986)
M. Clerbout, M. Latteux: Partial Commutations and faithful Rational Transductions; Theoret. Comp. Sci. 35 (1985), 241–254
R. Cori, D. Perrin: Automates et Commutations Partielles; R.A.I.R.O., Informatique theoriques 19, No. 1, (1985), 21–32
M.C. Golumbic: Algorithmic graph theory and perfect graphs; Academic Press, New York 1986
W. Kuich, A. Salomaa: Semirings, Automata, Languages; EATCS monographs, Vol 5, Springer, Berlin 1986
Y. Métivier, E. Ochmanski: On lexicographic semi-commutations; Inform. Proc. Letters 26 (1987/88) 55–59
F. Otto: Finite canonical rewriting systems for congruences generated by concurrency relations; to appear in: Math. Syst. Theory
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diekert, V. (1988). Transitive orientations, möbius functions, and complete semi-thue systems for free partially commutative monoids. In: Lepistö, T., Salomaa, A. (eds) Automata, Languages and Programming. ICALP 1988. Lecture Notes in Computer Science, vol 317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19488-6_115
Download citation
DOI: https://doi.org/10.1007/3-540-19488-6_115
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19488-0
Online ISBN: 978-3-540-39291-0
eBook Packages: Springer Book Archive