Pages that link to "Item:Q2784496"
From MaRDI portal
The following pages link to Decidability of termination of grid string rewriting rules (Q2784496):
Displaying 7 items.
- Reverse mathematical bounds for the termination theorem (Q324248) (← links)
- A canonical automaton for one-rule length-preserving string rewrite systems (Q498407) (← links)
- Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
- On prefixal one-rule string rewrite systems (Q2330116) (← links)
- (Q4447248) (← links)
- On rationally controlled one-rule insertion systems (Q5044416) (← links)
- Grid structures and undecidable constraint theories (Q5941204) (← links)