The following pages link to (Q3795205):
Displaying 8 items.
- Levels of undecidability in rewriting (Q627134) (← links)
- Simulation of Turing machines by a regular rewrite rule (Q1199548) (← 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)
- Simulation of Turing machines by a left-linear rewrite rule (Q5055715) (← links)
- Extensions and comparison of simplification orderings (Q5055737) (← links)
- AC-Termination of rewrite systems: A modified Knuth-Bendix ordering (Q5096208) (← links)
- One-rule trace-rewriting systems and confluence (Q5096864) (← links)
