Abstract
We extend the notion of concurrent iteration defined on trace languages by E.Ochmanski to languages closed under a semi-commutation relation which is the non-symmetric version of partial commutation relation: we iterate strongly connected components of words. For a given semi-commutation relation, this leads to the definition of a new family of rational languages closed under the semi-commutation. We give a necessary and sufficient condition for a language closed under a semi-commutation relation to be a rational language and we proved that the equality between the families of rational languages and recognizable languages closed under a semi-commutation relation is true if and only if the semi-commutation is symmetric (i.e a partial commutation).
This work has been partially supported by the EBRA working group 3166 ASMICS and by the PRC “Mathematiques et Informatique”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.Aalbersberg and G.Rozenberg. Theory of traces. Theoretical Computer Science 60:1–82, 1988.
M.Clerbout. Commutations partielles et Familles de langages. Thesis, University of Lille, 1984.
M.Clerbout and M.Latteux. On Semi-commutations. Information and Computation 73:59–74, 1987.
R.Cori and D.Perrin. Automates et commutations partielles. RAIRO Informatique 19:21–32, 1985.
V.Diekert. Combinatorics on Traces. Lecture Notes In Computer Science, 454
M.Latteux. On semi-commutations. In M.Ito, editor, Proceedings of the International Colloquium on Words, Languages and Combinatorics, Kyoto 1990, World Scientific, Singapore, 1990.
A.Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
Y.Metivier. Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif. RAIRO Informatique Théorique et Applications, 20:121–127, 1986.
E.Ochmanski. Regular Behaviour of Concurrent Systems. Bulletin of EATCS 27:56–67, Oct 85.
E.Ochmanski. Semi-Commutations for Place/transition systems. Bulletin of EATCS 38:191–198, June 1989.
D. Perrin. Partial Commutations. In Proceedings of the 16th International Colloquium on Automata, Languages and Programming (ICALP'89), Lecture Notes in Computer Science 372:637–651.
Y.Roos. Contribution à l'étude des fonctions de commutation partielle. Thesis, University of Lille, 1989.
W.Zielonka. Notes on asynchronous automata. RAIRO Informatique Théorique et Applications, 21:99–135, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clerbout, M., Latteux, M., Roos, Y., Zielonka, W. (1992). Semi-commutations and rational expressions. In: Kuich, W. (eds) Automata, Languages and Programming. ICALP 1992. Lecture Notes in Computer Science, vol 623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55719-9_68
Download citation
DOI: https://doi.org/10.1007/3-540-55719-9_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55719-7
Online ISBN: 978-3-540-47278-0
eBook Packages: Springer Book Archive