Abstract
We define atomic semi commutations as being associated to independance relations the form of which is A × B, in which A and B are two disjoint subsets of the alphabet. We prove that semi commutations can be decomposed in weaker semi commutations if and only if they are not atomic. We then deduce that every semi commutation can be obtained by a composition of atomic semi commutations and we suggest a decomposition algorithm.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
IJ.J. Aabersberg & G. Rozenberg. Theory of Traces. Theorical Computer Science 60 (1986) 1–83.
J.Berstel. Transductions and Context-Free Languages. Teubner (1979).
J. Berstel & J. Sakarovich. Recents results in the theory of rational sets. Lect. Notes in Comp.Sci. 233 (1986) 15–28.
P.Cartier & D.Foata. Problèmes combinatoires de commutations et réarrangements. Lect. Notes in Math. 85 (1969).
M.Clerbout. Commutations partielles et familles de langages. Thèse, Université de Lille (1984).
M. Clerbout, Compositions de fonctions de commutation partielle. RAIRO Informatique Théorique et Applications 23 (1989) 395–424.
M. Clerbout & M. Latteux. Partial commutations and faithful rational transductions. Theoretical Computer Science 34 (1984) 241–254.
M.Clerbout & M.Latteux. On a generalization of partial commutations. in M.Arato, I.Katai, L.varga, eds, Prc.Fourth Hung. Computer Sci.Conf (1985) 15–24.
M. Clerbout & M. Latteux. Semi-commutations. Information and Computation 73 (1987) 59–74.
M.Clerbout, M.Latteux & Y.Roos, Decomposition of partial commutations, Publication interne LIFL, Université de Lille, IT173 (1989) and ICALP'90.
R.Cori. Partially abelian monoids. Invited lecture, STACS, Orsay (1986).
R. Cori & D. Perrin. Automates et commutations partielles. RAIRO Inform. Theor. 19 (1985) 21–32.
M.Latteux, Rational cones and commutations. Machines, Languages and Complexity. J.Dassow and J.Kelemen eds., Lect. Notes in Comp.Sci. (1989) 37–54.
A.Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI PB 78, University of Aarhus (1977).
A. Mazurkiewicz. Traces, histories and graphs: instances of process monoids. Lect. Notes in Comp.Sci. 176 (1984) 115–133.
Y. Metivier. On recognizable subsets of free partially commutative monoids. Lect. Notes in Comp.Sci. 226 (1986) 254–264.
E. Ochmanski. Regular behaviour of concurrent systems. Bulletin of EATCS 27 (1985) 56–67.
D.Perrin. Words over a partially commutative alphabet. NATO ASI Series F12, Springer (1985) 329–340.
Y.Roos. Contribution à l'étude des fonctions de commutations partielles. Thèse, Université de Lille (1989).
W. Zielonka. Notes on asynchronous automata. RAIRO Inform. Theor. 21 (1987) 99–135.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clerbout, M., Gonzalez, D. (1990). Decomposition of semi commutations. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029610
Download citation
DOI: https://doi.org/10.1007/BFb0029610
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52953-8
Online ISBN: 978-3-540-47185-1
eBook Packages: Springer Book Archive