On the Knuth-Bendix completion for concurrent processes
14th International Colloquium on Automata, languages and programming
Information Processing Letters
Confluent string rewriting
Membership problems for regular and context-free trace languages
Information and Computation
Combinatorial rewriting on traces
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
Combinatorics on traces
Word problems over the traces which are solvable in linear time
IDTC Second international conference on Database theory
String-rewriting systems
The Book of Traces
Theory of Codes
Trace Rewriting: Computing Normal Forms in Time O(n log n)
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
On the Confluence of Trace Rewriting Systems
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Confluence of One-Rule Thue Systems
IWWERT '90 Proceedings of the First International Workshop on Word Equations and Related Topics
Algorithms and Reductions for Rewriting Problems
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
On Efficient Reduction Algorithms for Some Trace Rewriting Systems
Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
On the Theory of One-Step Rewriting in Trace Monoids
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Existential and Positive Theories of Equations in Graph Products
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
Rewriting systems over trace monoids, briefly trace rewriting systems, generalize both semi-Thue systems and vector replacement systems. In [21], a particular trace monoid M is presented such that confluence is undecidable for the class of length-reducing trace rewriting systems over M. In this paper, we show that this result holds for every trace monoid, which is neither free nor free commutative. Furthermore we show that confluence for special trace rewriting systems over a fixed trace monoid is decidable in polynomial time. Copyright 2001 "Academic Press.