The following pages link to (Q3998014):
Displaying 20 items.
- On termination of confluent one-rule string-rewriting systems (Q286976) (← links)
- A canonical automaton for one-rule length-preserving string rewrite systems (Q498407) (← links)
- Termination of string rewriting proved automatically (Q850497) (← links)
- Termination proofs for string rewriting systems via inverse match-bounds (Q851146) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- Simple termination is difficult (Q1343111) (← links)
- On normalizing, non-terminating one-rule string rewriting systems (Q1575660) (← links)
- Match-bounded string rewriting systems (Q1762560) (← links)
- Left-divisibility and word problems in single relation monoids (Q1924517) (← links)
- The word problem for one-relation monoids: a survey (Q1982573) (← links)
- On prefixal one-rule string rewrite systems (Q2330116) (← links)
- One-rule semi-Thue systems with loops of length one, two or three (Q3126011) (← links)
- Deciding Innermost Loops (Q3522030) (← links)
- Loops under Strategies (Q3636816) (← links)
- Non-Looping String Rewriting (Q4718895) (← links)
- Simple termination is difficult (Q5055798) (← links)
- More problems in rewriting (Q5055812) (← links)
- On the termination problem for one-rule semi-Thue system (Q5055868) (← links)
- One-rule trace-rewriting systems and confluence (Q5096864) (← links)
- Termination and derivational complexity of confluent one-rule string-rewriting systems (Q5958138) (← links)
