Analysis of algorithms for the recognition of rational and context-free trace languages
RAIRO-Theor. Inf. Appl., 32 4-6 (1998) 141-152
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):
Beyond the Horizon of Computability
Cyril Banderier and Massimiliano GoldwurmLecture Notes in Computer Science, Beyond the Horizon of Computability 12098 251 (2020)
https://doi.org/10.1007/978-3-030-51466-2_22
Forbidden traces and forbidden subtraces
K. V. Shahbazyan and Yu. H. ShoukourianCybernetics and Systems Analysis 49 (3) 325 (2013)
https://doi.org/10.1007/s10559-013-9515-2
Asynchronous trace-matching automata
K. V. Shahbazyan and Yu. H. ShoukourianCybernetics and Systems Analysis 48 (3) 323 (2012)
https://doi.org/10.1007/s10559-012-9411-1
Inclusion problems in trace monoids
K. V. Shahbazyan and Yu. H. ShoukourianCybernetics and Systems Analysis 46 (4) 546 (2010)
https://doi.org/10.1007/s10559-010-9231-0
257 (2010)
https://doi.org/10.1109/CIT.2010.77
Efficient recognition of trace languages defined by repeat-until loops
Luca Breveglieri, Stefano Crespi Reghizzi and Massimiliano GoldwurmInformation and Computation 208 (8) 969 (2010)
https://doi.org/10.1016/j.ic.2010.03.001
Clique polynomials have a unique root of smallest modulus
Massimiliano Goldwurm and Massimo SantiniInformation Processing Letters 75 (3) 127 (2000)
https://doi.org/10.1016/S0020-0190(00)00086-7
STACS 2000
Alberto Bertoni, Massimiliano Goldwurm and Massimo SantiniLecture Notes in Computer Science, STACS 2000 1770 567 (2000)
https://doi.org/10.1007/3-540-46541-3_47