Pages that link to "Item:Q5055715"
From MaRDI portal
The following pages link to Simulation of Turing machines by a left-linear rewrite rule (Q5055715):
Displaying 13 items.
- On termination of confluent one-rule string-rewriting systems (Q286976) (← links)
- Some undecidable termination problems for semi-Thue systems (Q673625) (← links)
- Simulation of Turing machines by a regular rewrite rule (Q1199548) (← links)
- Some undecidability results concerning the property of preserving regularity (Q1274984) (← links)
- Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
- Decidability of confluence and termination of monadic term rewriting systems (Q5055767) (← links)
- Open problems in rewriting (Q5055780) (← links)
- Linear interpretations by counting patterns (Q5055811) (← links)
- More problems in rewriting (Q5055812) (← links)
- A complete characterization of termination of 0p 1q→1r 0s (Q5055817) (← links)
- Decidable approximations of term rewriting systems (Q5055873) (← links)
- Type removal in term rewriting (Q5881182) (← links)
- Termination of term rewriting by interpretation (Q5881183) (← links)
