Pages that link to "Item:Q1262758"
From MaRDI portal
The following pages link to On deciding confluence of finite string-rewriting systems modulo partial commutativity (Q1262758):
Displaying 13 items.
- Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984) (← links)
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
- The problems of cyclic equality and conjugacy for finite complete rewriting systems (Q1089798) (← links)
- Rewriting systems and word problems in a free partially commutative monoid (Q1102124) (← links)
- Lambda-confluence for context rewriting systems (Q2344748) (← links)
- Algorithms and reductions for rewriting problems (Q2730723) (← links)
- On finite commutative Thue systems (Q2745475) (← links)
- Finite canonical rewriting systems for congruences generated by concurrency relations (Q3779772) (← links)
- On confluence of one-rule trace-rewriting systems (Q4841768) (← links)
- Infinite Families of Finite String Rewriting Systems and Their Confluence (Q4933319) (← links)
- Confluence of prefix-constrained rewrite systems (Q4993332) (← links)
- One-rule trace-rewriting systems and confluence (Q5096864) (← links)
- Confluence of algebraic rewriting systems (Q5879266) (← links)
