The following pages link to Non-Looping String Rewriting (Q4718895):
Displaying 15 items.
- Termination of string rewriting proved automatically (Q850497) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- On normalizing, non-terminating one-rule string rewriting systems (Q1575660) (← links)
- Loop detection by logically constrained term rewriting (Q1629968) (← links)
- Match-bounded string rewriting systems (Q1762560) (← links)
- Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
- Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
- Relative undecidability in term rewriting. II: The confluence hierarchy (Q1854560) (← links)
- On prefixal one-rule string rewrite systems (Q2330116) (← links)
- Proof Relevant Corecursive Resolution (Q2798268) (← links)
- One-rule semi-Thue systems with loops of length one, two or three (Q3126011) (← links)
- (Q5089023) (← links)
- (Q5507056) (← links)
- On string replacement exponentiation (Q5937085) (← links)
- Non-termination in Term Rewriting and Logic Programming (Q6493567) (← links)