Pages that link to "Item:Q2266711"
From MaRDI portal
The following pages link to Calcul de longueurs de chaînes de réécriture dans le monoïde libre (Q2266711):
Displaying 9 items.
- Termination of rewriting (Q1098624) (← links)
- Thue systems as rewriting systems (Q1099642) (← links)
- An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942) (← links)
- On normalizing, non-terminating one-rule string rewriting systems (Q1575660) (← links)
- The word problem for one-relation monoids: a survey (Q1982573) (← links)
- One-rule semi-Thue systems with loops of length one, two or three (Q3126011) (← links)
- On confluence of one-rule trace-rewriting systems (Q4841768) (← links)
- Open problems in rewriting (Q5055780) (← links)
- More problems in rewriting (Q5055812) (← links)