Pages that link to "Item:Q4571993"
From MaRDI portal
The following pages link to The word matching problem is undecidable for finite special string-rewriting systems that are confluent (Q4571993):
Displaying 6 items.
- Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984) (← links)
- On deciding the confluence of a finite string-rewriting system on a given congruence class (Q1102946) (← links)
- Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)
- Some properties of finite special string-rewriting systems (Q1201349) (← links)
- A NOTE ON THE EXISTENTIAL THEORY OF EQUATIONS IN PLAIN GROUPS (Q4786308) (← links)
- Restrictions of congruences generated by finite canonical string-rewriting systems (Q5055732) (← links)