Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
RAIRO-Theor. Inf. Appl., 20 2 (1986) 121-127
Published online: 2017-02-01
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):
Two techniques in the area of the star problem in trace monoids
Daniel Kirsten and Jerzy MarcinkowskiTheoretical Computer Science 309 (1-3) 381 (2003)
https://doi.org/10.1016/S0304-3975(03)00313-X
The Star Problem and the Finite Power Property in Trace Monoids: Reductions beyond C4
Daniel KirstenInformation and Computation 176 (1) 22 (2002)
https://doi.org/10.1006/inco.2002.3152
Automata, Languages and Programming
Daniel KirstenLecture Notes in Computer Science, Automata, Languages and Programming 2076 591 (2001)
https://doi.org/10.1007/3-540-48224-5_49
TAPSOFT '97: Theory and Practice of Software Development
Isabelle Biermann and Brigitte RozoyLecture Notes in Computer Science, TAPSOFT '97: Theory and Practice of Software Development 1214 165 (1997)
https://doi.org/10.1007/BFb0030594
Mathematical Foundations of Computer Science 1995
Sébastien Huguet and Antoine PetitLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1995 969 467 (1995)
https://doi.org/10.1007/3-540-60246-1_152
Recognizable languages in concurrency monoids
Manfred DrosteTheoretical Computer Science 150 (1) 77 (1995)
https://doi.org/10.1016/0304-3975(94)00266-L
STACS 94
Yves Métivier and GwénaËl RichommeLecture Notes in Computer Science, STACS 94 775 339 (1994)
https://doi.org/10.1007/3-540-57785-8_153
On the structure of recognizable languages of dependence graphs
A. Ehrenfeucht, H. J. Hoogeboom and G. RozenbergRAIRO - Theoretical Informatics and Applications 27 (1) 7 (1993)
https://doi.org/10.1051/ita/1993270100071
String matching problems over free partially commutative monoids
Kosaburo Hashiguchi and Kazuya YamadaInformation and Computation 101 (2) 131 (1992)
https://doi.org/10.1016/0890-5401(92)90060-S
Parties reconnaissables de monoïdes définis par générateurs et relations
Jacqueline LacazeRAIRO - Theoretical Informatics and Applications 26 (6) 541 (1992)
https://doi.org/10.1051/ita/1992260605411
Automata, Languages and Programming
M. Clerbout, M. Latteux, Y. Roos and W. ZielonkaLecture Notes in Computer Science, Automata, Languages and Programming 623 113 (1992)
https://doi.org/10.1007/3-540-55719-9_68
Decidability of the Star Problem in
Paul Gastin, Edward Ochmanski, Antoine Petit and Brigitte RozoyInformation Processing Letters 44 (2) 65 (1992)
https://doi.org/10.1016/0020-0190(92)90187-Z
Overlaps in free partially commutative monoids
Friedrich Otto and Celia WrathallJournal of Computer and System Sciences 42 (2) 186 (1991)
https://doi.org/10.1016/0022-0000(91)90010-3
Recognizable closures and submonoids of free partially commutative monoids
Kosaburo HashiguchiTheoretical Computer Science 86 (2) 233 (1991)
https://doi.org/10.1016/0304-3975(91)90019-X
STACS 91
Paul GastinLecture Notes in Computer Science, STACS 91 480 89 (1991)
https://doi.org/10.1007/BFb0020790
An extension of the notions of traces and of asynchronous automata
A. ArnoldRAIRO - Theoretical Informatics and Applications 25 (4) 355 (1991)
https://doi.org/10.1051/ita/1991250403551
Automata, Languages and Programming
Paul Gastin, Antoine Petit and Wieslaw ZielonkaLecture Notes in Computer Science, Automata, Languages and Programming 510 254 (1991)
https://doi.org/10.1007/3-540-54233-7_139
Automata, Languages and Programming
Gérard Duchamp and Daniel KrobLecture Notes in Computer Science, Automata, Languages and Programming 510 242 (1991)
https://doi.org/10.1007/3-540-54233-7_138
Semantics of Systems of Concurrent Processes
Paul GastinLecture Notes in Computer Science, Semantics of Systems of Concurrent Processes 469 277 (1990)
https://doi.org/10.1007/3-540-53479-2_12
Automata, Languages and Programming
Dominique PerrinLecture Notes in Computer Science, Automata, Languages and Programming 372 637 (1989)
https://doi.org/10.1007/BFb0035789
Characterizations of the decidability of some problems for regular trace languages
IJ. J. Aalbersberg and H. J. HoogeboomMathematical Systems Theory 22 (1) 1 (1989)
https://doi.org/10.1007/BF02088289
On recognizable subsets of free partially commutative monoids
Y. MetivierTheoretical Computer Science 58 (1-3) 201 (1988)
https://doi.org/10.1016/0304-3975(88)90027-8
Theory of traces
IJsbrand Jan Aalbersberg and Grzegorz RozenbergTheoretical Computer Science 60 (1) 1 (1988)
https://doi.org/10.1016/0304-3975(88)90051-5
On regular trace languages
Jacques SakarovitchTheoretical Computer Science 52 (1-2) 59 (1987)
https://doi.org/10.1016/0304-3975(87)90080-6