Abstract
We characterize the solutions of all the equations in two unknowns in the free partially commutative monolds. We show that the solutions are basically cyclic. Afterwards, we define the transposition (t and t′ are transposed iff t=xy and t′=yx) and the conjugacy relations (t and t′ are conjugate iff tλ=λt′). We show that the conjugacy is the transitive closure of the transposition and that the set of conjugacy factors λ is a recognizable subset of the partially commutative monoid.
Preview
Unable to display preview. Download preview PDF.
References
I.J. AALBERSBERG and E. WELZL, Trace languages defined by regular string Languages, to appear.
P. CARTIER and D. FOATA, "Problèmes Combinatoires de commutation et réarrangements", Lecture Notes in Math. 85 (Springer Verlag, 1969)
R. CORI and Y. METIVIER, Recognizable subsets of some partially abelian monoids, Theoret. Comput. Sci. 35 (1985) 179–190.
R. CORI and D. PERRIN, Automates et commutations partielles, Rairo Informat. Theor. 19 (1985) 21–32.
C. DUBOC, Some properties of commutation in free partially commutative monoids, Inform. processing letters 20 (1985) 1–4.
M.P. FLE and G. ROUCAIROL, Maximal Serializability of iterated transactions, Theoret. Comput. Sci. 38 (1985) 1–16.
M. LOTHAIRE, "Combinatorics on words" (Addison Wesley, 1983).
A. MAZURKIEWICZ, Concurrent program schemes and their interpretations, DAIMI Rep., PB-78, Aarhus University (1977).
Y. METIVIER, Une condition suffisante de reconnaissabilité dans les monoïdes partiellement commutatifs, To appear.
D. PERRIN, Words over a partially commutative alphabet, Rapport LITP no 8459 (Paris, 1984).
J.E. PIN, "Variétés de Langages Formels," (Masson, Paris, 1984).
J. SAKAROVITCH, On regular trace languages, to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Duboc, C. (1985). Equations in free partially commutative monoids. In: Monien, B., Vidal-Naquet, G. (eds) STACS 86. STACS 1986. Lecture Notes in Computer Science, vol 210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_76
Download citation
DOI: https://doi.org/10.1007/3-540-16078-7_76
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16078-6
Online ISBN: 978-3-540-39758-8
eBook Packages: Springer Book Archive