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):
14519 311 (2024)
https://doi.org/10.1007/978-3-031-52113-3_22
Local testability from words to traces, a suitable definition
Giovanna GuaianaTheoretical Computer Science 658 175 (2017)
https://doi.org/10.1016/j.tcs.2016.06.023
A Cut-Invariant Law of Large Numbers for Random Heaps
Samy AbbesJournal of Theoretical Probability 30 (4) 1692 (2017)
https://doi.org/10.1007/s10959-016-0692-6
Synchronization of Bernoulli sequences on shared letters
Samy AbbesInformation and Computation 255 1 (2017)
https://doi.org/10.1016/j.ic.2017.04.002
Developments in Language Theory
Dietrich Kuske and Olena PrianychnykovaLecture Notes in Computer Science, Developments in Language Theory 9840 256 (2016)
https://doi.org/10.1007/978-3-662-53132-7_21
Regular languages and partial commutations
Antonio Cano, Giovanna Guaiana and Jean-Éric PinInformation and Computation 230 76 (2013)
https://doi.org/10.1016/j.ic.2013.07.003
On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables
Manfred Droste and Paul GastinTheory of Computing Systems 42 (4) 608 (2008)
https://doi.org/10.1007/s00224-007-9064-z
The Group BS(1,2) and a Construction of Magnus
Patrick BahlsCommunications in Algebra 35 (12) 4088 (2007)
https://doi.org/10.1080/00927870701544831
Time-stamps for Mazurkiewicz traces
Wiesław ZielonkaTheoretical Computer Science 356 (1-2) 255 (2006)
https://doi.org/10.1016/j.tcs.2006.01.026
Mathematical Foundations of Computer Science 2006
Volker Diekert, Markus Lohrey and Alexander MillerLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2006 4162 292 (2006)
https://doi.org/10.1007/11821069_26
Coding and Cryptography
Françoise Levy-dit-Vehel and Ludovic PerretLecture Notes in Computer Science, Coding and Cryptography 3969 316 (2006)
https://doi.org/10.1007/11779360_25
98 (2005)
https://doi.org/10.1109/ACSD.2005.33
On a conjecture about finite fixed points of morphisms
F. Levé and G. RichommeTheoretical Computer Science 339 (1) 103 (2005)
https://doi.org/10.1016/j.tcs.2005.01.011
Machines, Computations, and Universality
René Schott and Jean-Claude SpehnerLecture Notes in Computer Science, Machines, Computations, and Universality 3354 316 (2005)
https://doi.org/10.1007/978-3-540-31834-7_26
Two optimal parallel algorithms on the commutation class of a word
René Schott and Jean-Claude SpehnerTheoretical Computer Science 324 (1) 107 (2004)
https://doi.org/10.1016/j.tcs.2004.03.048
Undecidability of the trace coding problem and some decidable cases
Michal KuncTheoretical Computer Science 310 (1-3) 393 (2004)
https://doi.org/10.1016/j.tcs.2003.08.004
Progress in Cryptology - INDOCRYPT 2004
Françoise Levy-dit-Vehel and Ludovic PerretLecture Notes in Computer Science, Progress in Cryptology - INDOCRYPT 2004 3348 275 (2004)
https://doi.org/10.1007/978-3-540-30556-9_22
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
Confluence Problems for Trace Rewriting Systems
Markus LohreyInformation and Computation 170 (1) 1 (2001)
https://doi.org/10.1006/inco.2001.3055
Mathematical Foundations of Computer Science 1999
Markus LohreyLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1999 1672 114 (1999)
https://doi.org/10.1007/3-540-48340-3_11
The Kleene–Schützenberger Theorem for Formal Power Series in Partially Commuting Variables
Manfred Droste and Paul GastinInformation and Computation 153 (1) 47 (1999)
https://doi.org/10.1006/inco.1999.2799
Analysis of algorithms for the recognition of rational and context-free trace languages
A. Avellone and M. GoldwurmRAIRO - Theoretical Informatics and Applications 32 (4-6) 141 (1998)
https://doi.org/10.1051/ita/1998324-601411
STACS 97
Jochen MessnerLecture Notes in Computer Science, STACS 97 1200 571 (1997)
https://doi.org/10.1007/BFb0023490
Handbook of Formal Languages
Volker Diekert and Yves MétivierHandbook of Formal Languages 457 (1997)
https://doi.org/10.1007/978-3-642-59126-6_8
The code problem for traces — improving the boundaries
Hendrik Jan Hoogeboom and Anca MuschollTheoretical Computer Science 172 (1-2) 309 (1997)
https://doi.org/10.1016/S0304-3975(96)00216-2
STACS 96
Michael Bertol and Volker DiekertLecture Notes in Computer Science, STACS 96 1046 269 (1996)
https://doi.org/10.1007/3-540-60922-9_23
Mathematical Foundations of Computer Science 1996
Volker Diekert and Anca MuschollLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1996 1113 2 (1996)
https://doi.org/10.1007/3-540-61550-4_137
The lattices of prefixes and overlaps of traces
C. WrathallDiscrete Mathematics 158 (1-3) 231 (1996)
https://doi.org/10.1016/0012-365X(95)00046-Y
STACS 95
Véronique Bruyère and Clelia EeliceLecture Notes in Computer Science, STACS 95 900 373 (1995)
https://doi.org/10.1007/3-540-59042-0_89
Term Rewriting
Michael Bertol and Volker DiekertLecture Notes in Computer Science, Term Rewriting 909 114 (1995)
https://doi.org/10.1007/3-540-59340-3_9
STACS 95
Volker Diekert, Anca Muscholl and Klaus ReinhardtLecture Notes in Computer Science, STACS 95 900 385 (1995)
https://doi.org/10.1007/3-540-59042-0_90
Recognizable languages in concurrency monoids
Manfred DrosteTheoretical Computer Science 150 (1) 77 (1995)
https://doi.org/10.1016/0304-3975(94)00266-L
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
On some decision problems for trace codings
Véronique Bruyère, Clelia De Felice and Giovanna GuaianaTheoretical Computer Science 148 (2) 227 (1995)
https://doi.org/10.1016/0304-3975(95)00036-V
Automata, Languages and Programming
Yves Métivier, GwénaËl Richomme and Pierre-André WacrenierLecture Notes in Computer Science, Automata, Languages and Programming 944 75 (1995)
https://doi.org/10.1007/3-540-60084-1_64
On confluence of one-rule trace-rewriting systems
C. Wrathall and V. DiekertMathematical Systems Theory 28 (4) 341 (1995)
https://doi.org/10.1007/BF01185401
Schützenberger-like products in non-free monoids
Roman R. RedziejowskiRAIRO - Theoretical Informatics and Applications 29 (3) 209 (1995)
https://doi.org/10.1051/ita/1995290302091
Trees in Algebra and Programming — CAAP'94
Yves Métivier and Nasser SahebLecture Notes in Computer Science, Trees in Algebra and Programming — CAAP'94 787 234 (1994)
https://doi.org/10.1007/BFb0017485
Automata, Languages and Programming
Manfred DrosteLecture Notes in Computer Science, Automata, Languages and Programming 820 388 (1994)
https://doi.org/10.1007/3-540-58201-0_84
STACS 94
Véronique Bruyère, Clelia Felice and Giovanna GuaianaLecture Notes in Computer Science, STACS 94 775 353 (1994)
https://doi.org/10.1007/3-540-57785-8_154
An extension of Kleene's and Ochmański's theorems to infinite traces
Paul Gastin, Antoine Petit and Wiesław ZielonkaTheoretical Computer Science 125 (2) 167 (1994)
https://doi.org/10.1016/0304-3975(94)90254-2
Atomic semicommutations
M. Clerbout and D. GonzalezTheoretical Computer Science 123 (2) 259 (1994)
https://doi.org/10.1016/0304-3975(92)00066-Z
A partial trace semantics for Petri nets
V DiekertTheoretical Computer Science 134 (1) 87 (1994)
https://doi.org/10.1016/0304-3975(94)90280-1
Möbius functions and confluent semi-commutations
Volker DiekertTheoretical Computer Science 108 (1) 25 (1993)
https://doi.org/10.1016/0304-3975(93)90229-M
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
Recognizable trace languages, distributed automata and the distribution problem
Antoine PetitActa Informatica 30 (1) 89 (1993)
https://doi.org/10.1007/BF01200264
On the concatenation of infinite traces
Volker DiekertTheoretical Computer Science 113 (1) 35 (1993)
https://doi.org/10.1016/0304-3975(93)90209-C
Mathematical Foundations of Computer Science 1993
Christophe Cérin and Antoine PetitLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1993 711 332 (1993)
https://doi.org/10.1007/3-540-57182-5_25
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
Mathematical Foundations of Computer Science 1992
C. Wrathall, V. Diekert and F. OttoLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1992 629 511 (1992)
https://doi.org/10.1007/3-540-55808-X_50
Semicommutations and algebraic algebraic
M. Clerbout and Y. RoosTheoretical Computer Science 103 (1) 39 (1992)
https://doi.org/10.1016/0304-3975(92)90086-U
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
The free partially commutative Lie algebra: Bases and ranks
G Duchamp and D KrobAdvances in Mathematics 95 (1) 92 (1992)
https://doi.org/10.1016/0001-8708(92)90045-M
Probabilistic estimation of the number of prefixes of a trace
Massimiliano GoldwurmTheoretical Computer Science 92 (2) 249 (1992)
https://doi.org/10.1016/0304-3975(92)90314-6
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
Two recognizable string-matching problems over free partially commutative monoids
Kosaburo Hashiguchi and Kazuya YamadaTheoretical Computer Science 92 (1) 77 (1992)
https://doi.org/10.1016/0304-3975(92)90136-4
Star-free trace languages
Giovanna Guaiana, Antonio Restivo and Sergio SalemiTheoretical Computer Science 97 (2) 301 (1992)
https://doi.org/10.1016/0304-3975(92)90080-Y
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
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
STACS 91
Volker DiekertLecture Notes in Computer Science, STACS 91 480 105 (1991)
https://doi.org/10.1007/BFb0020791
Event structures and trace monoids
Brigitte Rozoy and P.S. ThiagarajanTheoretical Computer Science 91 (2) 285 (1991)
https://doi.org/10.1016/0304-3975(91)90087-I
On the number of partially abelian square-free words on a three-letter alphabet
Robert Cori and Maria Rosaria FormisanoTheoretical Computer Science 81 (1) 147 (1991)
https://doi.org/10.1016/0304-3975(91)90322-S
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
Mathematical Foundations of Computer Science 1991
Y. Roos and P. A. WacrenierLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1991 520 406 (1991)
https://doi.org/10.1007/3-540-54345-7_84
A generalization of traces
Walter VoglerRAIRO - Theoretical Informatics and Applications 25 (2) 147 (1991)
https://doi.org/10.1051/ita/1991250201471
Trace monoids with some invertible generators: two decision problems
C. WrathallDiscrete Applied Mathematics 32 (2) 211 (1991)
https://doi.org/10.1016/0166-218X(91)90101-2
The parallel complexity of two problems on concurrency
C. Àlvarez and J. GabarróInformation Processing Letters 38 (2) 61 (1991)
https://doi.org/10.1016/0020-0190(91)90224-6
Graphs and free partially commutative monoids
Roman KönigTheoretical Computer Science 78 (2) 319 (1991)
https://doi.org/10.1016/0304-3975(91)90355-6
240 (1991)
https://doi.org/10.1109/SCT.1991.160267
Parle ’91 Parallel Architectures and Languages Europe
Carme Àlvarez, José L. Balcázar, Joaquim Gabarró and Miklós SánthaLecture Notes in Computer Science, Parle ’91 Parallel Architectures and Languages Europe 505 288 (1991)
https://doi.org/10.1007/978-3-662-25209-3_20
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
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
Partially abelian squarefree words
Robert Cori and Maria Rosaria FormisanoRAIRO - Theoretical Informatics and Applications 24 (6) 509 (1990)
https://doi.org/10.1051/ita/1990240605091
Non-repetitive words relative to a rewriting system
Arturo Carpi and Aldo de LucaTheoretical Computer Science 72 (1) 39 (1990)
https://doi.org/10.1016/0304-3975(90)90045-J
Distribution and synchronized automata
A. PetitTheoretical Computer Science 76 (2-3) 285 (1990)
https://doi.org/10.1016/0304-3975(90)90022-A
Automata, Languages and Programming
Mireille Clerbout, Michel Latteux and Yves RoosLecture Notes in Computer Science, Automata, Languages and Programming 443 501 (1990)
https://doi.org/10.1007/BFb0032054
Semantics of Systems of Concurrent Processes
Brigitte RozoyLecture Notes in Computer Science, Semantics of Systems of Concurrent Processes 469 434 (1990)
https://doi.org/10.1007/3-540-53479-2_19
Mathematical Foundations of Computer Science 1990
M. Clerbout and D. GonzalezLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1990 452 209 (1990)
https://doi.org/10.1007/BFb0029610
Word problems over traces which are solvable in linear time
Volker DiekertTheoretical Computer Science 74 (1) 3 (1990)
https://doi.org/10.1016/0304-3975(90)90003-Z
Efficient solution of some problems in free partially commutative monoids
Hai-Ning Liu, C. Wrathall and Kenneth ZegerInformation and Computation 89 (2) 180 (1990)
https://doi.org/10.1016/0890-5401(90)90010-F
Complete subgraphs of bipartite graphs and applications to trace languages
G. Guaiana, A. Restivo and S. SalemiRAIRO - Theoretical Informatics and Applications 24 (4) 409 (1990)
https://doi.org/10.1051/ita/1990240404091
Formal Models and Semantics
Dominique PERRINFormal Models and Semantics 1 (1990)
https://doi.org/10.1016/B978-0-444-88074-1.50006-8
A remark on the representation of trace monoids
C. ChoffrutSemigroup Forum 40 (1) 143 (1990)
https://doi.org/10.1007/BF02573262
Un modèle asynchrone pour les systèmes distribués
Paul GastinTheoretical Computer Science 74 (2) 121 (1990)
https://doi.org/10.1016/0304-3975(90)90134-4
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 the synchronization of traces
Volker Diekert and Walter VoglerMathematical Systems Theory 22 (1) 161 (1989)
https://doi.org/10.1007/BF02088296
Automata, Languages and Programming
Dominique PerrinLecture Notes in Computer Science, Automata, Languages and Programming 372 637 (1989)
https://doi.org/10.1007/BFb0035789
Machines, Languages, and Complexity
Michel LatteuxLecture Notes in Computer Science, Machines, Languages, and Complexity 381 37 (1989)
https://doi.org/10.1007/BFb0015926
Compositions de fonctions de commutation partielle
Mireille ClerboutRAIRO - Theoretical Informatics and Applications 23 (4) 395 (1989)
https://doi.org/10.1051/ita/1989230403951
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency
Antoni MazurkiewiczLecture Notes in Computer Science, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency 354 285 (1989)
https://doi.org/10.1007/BFb0013025
On the Knuth-Bendix completion for concurrent processes
Volker DiekertTheoretical Computer Science 66 (2) 117 (1989)
https://doi.org/10.1016/0304-3975(89)90131-X
STACS 89
Volker DiekertLecture Notes in Computer Science, STACS 89 349 168 (1989)
https://doi.org/10.1007/BFb0028982
Serialization of concurrent programs
Marie-Paule FléJournal of Computer and System Sciences 38 (3) 474 (1989)
https://doi.org/10.1016/0022-0000(89)90012-3
On deciding confluence of finite string-rewriting systems modulo partial commutativity
Friedrich OttoTheoretical Computer Science 67 (1) 19 (1989)
https://doi.org/10.1016/0304-3975(89)90019-4
Combinatorics, Computing and Complexity
C. WrathallMathematics and Its Applications, Combinatorics, Computing and Complexity 1 195 (1989)
https://doi.org/10.1007/978-94-009-2411-6_10
Mathematical Foundations of Computer Science 1989
Antoine PetitLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1989 379 418 (1989)
https://doi.org/10.1007/3-540-51486-4_89
The word problem for free partially commutative groups
C. WrathallJournal of Symbolic Computation 6 (1) 99 (1988)
https://doi.org/10.1016/S0747-7171(88)80024-5
STACS 88
D. Bruschi, G. Pighizzini and N. SabadiniLecture Notes in Computer Science, STACS 88 294 334 (1988)
https://doi.org/10.1007/BFb0035857
Automata, Languages and Programming
R. Cori and Y. MétivierLecture Notes in Computer Science, Automata, Languages and Programming 317 147 (1988)
https://doi.org/10.1007/3-540-19488-6_113