Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

This article has been cited by the following article(s):

On recognizable subsets of free partially commutative monoids

Y. Metivier
Theoretical Computer Science 58 (1-3) 201 (1988)
DOI: 10.1016/0304-3975(88)90027-8
See this article

An extension of the notions of traces and of asynchronous automata

A. Arnold
RAIRO - Theoretical Informatics and Applications 25 (4) 355 (1991)
DOI: 10.1051/ita/1991250403551
See this article

On the structure of recognizable languages of dependence graphs

A. Ehrenfeucht, H. J. Hoogeboom and G. Rozenberg
RAIRO - Theoretical Informatics and Applications 27 (1) 7 (1993)
DOI: 10.1051/ita/1993270100071
See this article

Parties reconnaissables de monoïdes définis par générateurs et relations

Jacqueline Lacaze
RAIRO - Theoretical Informatics and Applications 26 (6) 541 (1992)
DOI: 10.1051/ita/1992260605411
See this article

Yves Métivier and GwénaËl Richomme
775 339 (1994)
DOI: 10.1007/3-540-57785-8_153
See this article

Gérard Duchamp and Daniel Krob
510 242 (1991)
DOI: 10.1007/3-540-54233-7_138
See this article

String matching problems over free partially commutative monoids

Kosaburo Hashiguchi and Kazuya Yamada
Information and Computation 101 (2) 131 (1992)
DOI: 10.1016/0890-5401(92)90060-S
See this article

Isabelle Biermann and Brigitte Rozoy
1214 165 (1997)
DOI: 10.1007/BFb0030594
See this article

M. Clerbout, M. Latteux, Y. Roos and W. Zielonka
623 113 (1992)
DOI: 10.1007/3-540-55719-9_68
See this article

Two techniques in the area of the star problem in trace monoids

Daniel Kirsten and Jerzy Marcinkowski
Theoretical Computer Science 309 (1-3) 381 (2003)
DOI: 10.1016/S0304-3975(03)00313-X
See this article

Recognizable languages in concurrency monoids

Manfred Droste
Theoretical Computer Science 150 (1) 77 (1995)
DOI: 10.1016/0304-3975(94)00266-L
See this article

Characterizations of the decidability of some problems for regular trace languages

IJ. J. Aalbersberg and H. J. Hoogeboom
Mathematical Systems Theory 22 (1) 1 (1989)
DOI: 10.1007/BF02088289
See this article

On regular trace languages

Jacques Sakarovitch
Theoretical Computer Science 52 (1-2) 59 (1987)
DOI: 10.1016/0304-3975(87)90080-6
See this article

Overlaps in free partially commutative monoids

Friedrich Otto and Celia Wrathall
Journal of Computer and System Sciences 42 (2) 186 (1991)
DOI: 10.1016/0022-0000(91)90010-3
See this article

Sébastien Huguet and Antoine Petit
969 467 (1995)
DOI: 10.1007/3-540-60246-1_152
See this article

Recognizable closures and submonoids of free partially commutative monoids

Kosaburo Hashiguchi
Theoretical Computer Science 86 (2) 233 (1991)
DOI: 10.1016/0304-3975(91)90019-X
See this article

Decidability of the Star Problem in

Paul Gastin, Edward Ochmanski, Antoine Petit and Brigitte Rozoy
Information Processing Letters 44 (2) 65 (1992)
DOI: 10.1016/0020-0190(92)90187-Z
See this article

Theory of traces

IJsbrand Jan Aalbersberg and Grzegorz Rozenberg
Theoretical Computer Science 60 (1) 1 (1988)
DOI: 10.1016/0304-3975(88)90051-5
See this article

Paul Gastin, Antoine Petit and Wieslaw Zielonka
510 254 (1991)
DOI: 10.1007/3-540-54233-7_139
See this article