Pages that link to "Item:Q1201349"

The following pages link to Some properties of finite special string-rewriting systems (Q1201349):

Displaying 11 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 deciding the confluence of a finite string-rewriting system on a given congruence class (Q1102946) (← links)
• It is undecidable whether a finite special string-rewriting system presents a group (Q1184861) (← links)
• Completing a finite special string-rewriting system on the congruence class of the empty word (Q1191634) (← links)
• Undecidable properties on length-two string rewriting systems (Q2873677) (← links)
• (Q4255520) (← links)
• The word matching problem is undecidable for finite special string-rewriting systems that are confluent (Q4571993) (← links)
• Infinite Families of Finite String Rewriting Systems and Their Confluence (Q4933319) (← links)
• Restrictions of congruences generated by finite canonical string-rewriting systems (Q5055732) (← links)
• On one-relator groups and units of special one-relation inverse monoids (Q5877774) (← links)