Pages that link to "Item:Q286976"

The following pages link to On termination of confluent one-rule string-rewriting systems (Q286976):

Displaying 13 items.

• A canonical automaton for one-rule length-preserving string rewrite systems (Q498407) (← links)
• Adding constants to string rewriting (Q945008) (← links)
• On deciding confluence of finite string-rewriting systems modulo partial commutativity (Q1262758) (← links)
• On normalizing, non-terminating one-rule string rewriting systems (Q1575660) (← links)
• A complete characterization of termination of \(0^p1^q\to 1^r0^s\) (Q1583881) (← links)
• A Lyndon's identity theorem for one-relator monoids (Q2135760) (← links)
• Decidability of termination of grid string rewriting rules (Q2784496) (← links)
• Reducing the gradedness problem of string rewriting systems to a termination problem (Q3465631) (← links)
• (Q4447248) (← links)
• Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System (Q4989173) (← links)
• A complete characterization of termination of 0p 1q→1r 0s (Q5055817) (← links)
• Term Rewriting and Applications (Q5703860) (← links)
• Termination and derivational complexity of confluent one-rule string-rewriting systems (Q5958138) (← links)