Trace monoids with some invertible generators: Two decision problems
From MaRDI portal
Publication:1179186
DOI10.1016/0166-218X(91)90101-2zbMath0736.20033MaRDI QIDQ1179186
Publication date: 26 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
20M05: Free semigroups, generators and relations, word problems
68Q42: Grammars and rewriting systems
Cites Work
- The undecidability of the preperfectness of Thue systems
- Maximal serializability of iterated transactions
- On some equations in free partially commutative monoids
- The problems of cyclic equality and conjugacy for finite complete rewriting systems
- Rewriting systems and word problems in a free partially commutative monoid
- Theory of traces
- The word problem for free partially commutative groups
- Efficient solution of some problems in free partially commutative monoids
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item