The following pages link to (Q3939790):
Displaying 6 items.
- A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems (Q844899) (← links)
- Some undecidability results for non-monadic Church-Rosser Thue systems (Q1057264) (← links)
- Complexity results on the conjugacy problem for monoids (Q1073015) (← links)
- Thue systems as rewriting systems (Q1099642) (← links)
- Rewriting systems and word problems in a free partially commutative monoid (Q1102124) (← links)
- Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule (Q1107523) (← links)
