Automates et commutations partielles
RAIRO. Inform. théor., 19 1 (1985) 21-32
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):
2-Asynchronous automata
Robert Cori, Eric Sopena, Michel Latteux and Yves RoosTheoretical Computer Science 61 (1) 93 (1988)
https://doi.org/10.1016/0304-3975(88)90110-7
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
Theoremes de transfert pour les polynomes partiellement commutatifs
G. Duchamp and J.Y. ThibonTheoretical Computer Science 57 (2-3) 239 (1988)
https://doi.org/10.1016/0304-3975(88)90041-2
STACS 88
Edward OchmanskiLecture Notes in Computer Science, STACS 88 294 346 (1988)
https://doi.org/10.1007/BFb0035858
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
Semi-commutations
M. Clerbout and M. LatteuxInformation and Computation 73 (1) 59 (1987)
https://doi.org/10.1016/0890-5401(87)90040-X
Rewriting systems and word problems in a free partially commutative monoid
Ronald V. Book and Hai-Ning LiuInformation Processing Letters 26 (1) 29 (1987)
https://doi.org/10.1016/0020-0190(87)90032-9
Automata, Languages and Programming
Volker DiekertLecture Notes in Computer Science, Automata, Languages and Programming 267 42 (1987)
https://doi.org/10.1007/3-540-18088-5_5
Automata, Languages and Programming
C. Choffrut and C. DubocLecture Notes in Computer Science, Automata, Languages and Programming 267 190 (1987)
https://doi.org/10.1007/3-540-18088-5_15
Notes on finite asynchronous automata
Wieslaw ZielonkaRAIRO - Theoretical Informatics and Applications 21 (2) 99 (1987)
https://doi.org/10.1051/ita/1987210200991
Monoïde libre et musique, première partie : les musiciens ont-ils besoin des mathématiques ?
Marc ChemillierRAIRO - Theoretical Informatics and Applications 21 (3) 341 (1987)
https://doi.org/10.1051/ita/1987210303411
On regular trace languages
Jacques SakarovitchTheoretical Computer Science 52 (1-2) 59 (1987)
https://doi.org/10.1016/0304-3975(87)90080-6
Automata, Languages and Programming
IJsbrand Jan Abalbersberg and Hendrik Jan HoogeboomLecture Notes in Computer Science, Automata, Languages and Programming 267 250 (1987)
https://doi.org/10.1007/3-540-18088-5_20
Concurrency and Nets
A. Ehrenfeucht and G. RozenbergConcurrency and Nets 141 (1987)
https://doi.org/10.1007/978-3-642-72822-8_11
Petri Nets: Applications and Relationships to Other Models of Concurrency
Antoni MazurkiewiczLecture Notes in Computer Science, Petri Nets: Applications and Relationships to Other Models of Concurrency 255 278 (1987)
https://doi.org/10.1007/3-540-17906-2_30
Automata, Languages and Programming
Y. MetivierLecture Notes in Computer Science, Automata, Languages and Programming 226 254 (1986)
https://doi.org/10.1007/3-540-16761-7_75
Trace languages defined by regular string languages
Ijsbrand Jan Aalbersberg and Emo WelzlRAIRO - Theoretical Informatics and Applications 20 (2) 103 (1986)
https://doi.org/10.1051/ita/1986200201031
STACS 86
Christine DubocLecture Notes in Computer Science, STACS 86 210 192 (1986)
https://doi.org/10.1007/3-540-16078-7_76
Mathematical Foundations of Computer Science 1986
Jean Berstel and Jacques SakarovitchLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1986 233 15 (1986)
https://doi.org/10.1007/BFb0016231
Mixed product and asynchronous automata
Christine DubocTheoretical Computer Science 48 183 (1986)
https://doi.org/10.1016/0304-3975(86)90094-0
On some equations in free partially commutative monoids
Christine DubocTheoretical Computer Science 46 159 (1986)
https://doi.org/10.1016/0304-3975(86)90028-9