Pages that link to "Item:Q1070349"
From MaRDI portal
The following pages link to On two problems related to cancellativity (Q1070349):
Displaying 8 items.
- Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984) (← links)
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
- On ground-confluence of term rewriting systems (Q913496) (← links)
- Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems (Q1123619) (← links)
- Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)
- When is an extension of a specification consistent? Decidable and undecidable cases (Q1186708) (← links)
- Restrictions of congruences generated by finite canonical string-rewriting systems (Q5055732) (← links)
- Some independence results for equational unification (Q5055843) (← links)
