Information Processing Letters
Membership problems for regular and context-free trace languages
Information and Computation
Combinatorics on traces
String-rewriting systems
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Confluent and Other Types of Thue Systems
Journal of the ACM (JACM)
The Book of Traces
Complexity Results for Confluence Problems
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
On the Confluence of Trace Rewriting Systems
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Algorithms and Reductions for Rewriting Problems
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Complexity Results for Confluence Problems
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
A functional, successor list based version of warshall's algorithm with applications
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
| Hi-index | 0.00 |
We study the complexity of the confluence problem for restricted kinds of semi-Thue systems, vector replacement systems and general trace rewriting systems. We prove that confluence for length-reducing semi-Thue systems is P-complete and that this complexity reduces to NC2 in the monadic case. For length-reducing vector replacement systems we prove that the confluence problem is PSPACE-complete and that the complexity reduces to NP and P for monadic systems and special systems, respectively. Finally we prove that for special trace rewriting systems, confluence can be decided in polynomial time and that the extended word problem for special trace rewriting systems is undecidable.