Pages that link to "Item:Q914395"
From MaRDI portal
The following pages link to Word problems over traces which are solvable in linear time (Q914395):
Displaying 4 items.
- The submonoid and rational subset membership problems for graph groups. (Q947493) (← links)
- The word problem for \(1\mathcal{LC}\) congruences is NP-hard. (Q1426452) (← links)
- Confluence problems for trace rewriting systems (Q1854457) (← links)
- Word problems over traces which are solvable in linear time (Q5096152) (← links)