On some decision problems for trace codings

DOI10.1016/0304-3975(95)00036-VzbMath0873.68170OpenAlexW2088388166MaRDI QIDQ672324

Clelia De Felice, Giovanna Guaiana, Véronique Bruyère

Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00036-v

zbMATH Keywords

trace monoids

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

Undecidability of the trace coding problem and some decidable cases

Cites Work

• A remark on the representation of trace monoids
• Graphs and free partially commutative monoids
• On some equations in free partially commutative monoids
• Theory of traces
• Combinatorics on traces
• Parallel concepts in graph theory
• Recognizable subsets of some partially Abelian monoids
• 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"
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On some decision problems for trace codings