The Trace Coding Problem Is Undecidable

Authors:
Michal Kunc
Affiliations:
-
Venue:
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Year:
2001

Citing 6
Cited 0

On some equations in free partially commutative monoids

Theoretical Computer Science
On some decision problems for trace codings

STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science
Partial commutation and traces

Handbook of formal languages, vol. 3
On the existence of codings between trace monoids

Journal of Automata, Languages and Combinatorics
Code Problems on Traces

MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
On Morphisms of Trace Monoids

STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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 Ochmański in 1988. We also show its decidability when restricted to instances with domain monoids defined by acyclic dependence graphs.