Pages that link to "Item:Q5055817"

The following pages link to A complete characterization of termination of 0p 1q→1r 0s (Q5055817):

Displaying 10 items.

• On termination of confluent one-rule string-rewriting systems (Q286976) (← links)
• The derivational complexity of string rewriting systems (Q441853) (← links)
• A canonical automaton for one-rule length-preserving string rewrite systems (Q498407) (← links)
• Termination modulo equations by abstract commutation with an application to iteration (Q1391793) (← 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)
• Dummy elimination in equational rewriting (Q5055853) (← links)
• On the termination problem for one-rule semi-Thue system (Q5055868) (← links)
• Dummy elimination: Making termination easier (Q5055895) (← links)
• Termination and derivational complexity of confluent one-rule string-rewriting systems (Q5958138) (← links)