Pages that link to "Item:Q797574"

The following pages link to The undecidability of the preperfectness of Thue systems (Q797574):

Displaying 11 items.

• Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group (Q760506) (← links)
• A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems (Q844899) (← links)
• On the regular equivalence problem for regular Thue systems (Q1087011) (← links)
• The undecidability of self-embedding for finite semi-Thue and Thue systems (Q1092041) (← 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)
• The word problem for free partially commutative groups (Q1109139) (← links)
• Trace monoids with some invertible generators: Two decision problems (Q1179186) (← links)
• On deciding confluence of finite string-rewriting systems modulo partial commutativity (Q1262758) (← links)
• On confluence of one-rule trace-rewriting systems (Q4841768) (← links)