The code problem for traces -- improving the boundaries

DOI10.1016/S0304-3975(96)00216-2zbMath0903.68129OpenAlexW1976491846MaRDI QIDQ1392032

Anca Muscholl, Hendrik Jan Hoogeboom

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00216-2

zbMATH Keywords

decidabilityunique decipherabilitycode problemMazurkiewicz' trace theory

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Codes and equations on trees ⋮ The star problem and the finite power property in trace monoids: Reductions beyond C4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The space complexity of the unique decipherability problem
• Combinatorics on traces
• Combinatorial problems of commutation and rearrangements
• On codings of traces
• Characterizations of the decidability of some problems for regular trace languages
• A Note on "The Comparability Graph of a Tree"