Abstract
We introduce the notion of weak morphisms of trace monoids and use it to deal with the problem of deciding the existence of codings between trace monoids. We prove that this problem is not recursively enumerable, which answers the question raised by Ochmanski in 1988. We also show its decidability when restricted to instances with domain monoids defined by acyclic dependence graphs. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Kunc, M. (2001). The trace coding problem is undecidable (extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2076 LNCS, pp. 603–614). Springer Verlag. https://doi.org/10.1007/3-540-48224-5_50
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
