The following pages link to (Q4941894):
Displaying 10 items.
- Word problems over traces which are solvable in linear time (Q914395) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- On confluent semi-commutations: Decidability and complexity results (Q1322470) (← links)
- Confluence problems for trace rewriting systems (Q1854457) (← links)
- Algorithms and reductions for rewriting problems (Q2730723) (← links)
- Complexity of a classical flow restoration problem (Q2811305) (← links)
- The Complexity of Deciding Strictly Non-Blocking Concentration and Generalized-Concentration Properties (Q4366866) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q5055831) (← links)
- Word problems over traces which are solvable in linear time (Q5096152) (← links)
- Computer Aided Verification (Q5900705) (← links)