Pages that link to "Item:Q5958138"
From MaRDI portal
The following pages link to Termination and derivational complexity of confluent one-rule string-rewriting systems (Q5958138):
Displaying 8 items.
- A canonical automaton for one-rule length-preserving string rewrite systems (Q498407) (← links)
- Termination proofs for string rewriting systems via inverse match-bounds (Q851146) (← links)
- Match-bounded string rewriting systems (Q1762560) (← links)
- Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
- Decidability of termination of grid string rewriting rules (Q2784496) (← links)
- (Q4447248) (← links)
- Non-Looping String Rewriting (Q4718895) (← links)
- Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System (Q4989173) (← links)