Pages that link to "Item:Q593775"

The following pages link to Decidable sentences of Church-Rosser congruences (Q593775):

Displaying 29 items.

• Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984) (← links)
• A decision algorithm for linear sentences on a PFM (Q685065) (← links)
• On weakly confluent monadic string-rewriting systems (Q685433) (← links)
• Conjugacy in monoids with a special Church-Rosser presentation is decidable (Q801163) (← links)
• About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
• Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
• Some undecidability results for non-monadic Church-Rosser Thue systems (Q1057264) (← links)
• On two problems related to cancellativity (Q1070349) (← links)
• Complexity results on the conjugacy problem for monoids (Q1073015) (← links)
• Pseudo-natural algorithms for the word problem for finitely presented monoids and groups (Q1074716) (← links)
• On deciding whether a monoid is a free monoid or is a group (Q1075439) (← links)
• Thue systems as rewriting systems (Q1099642) (← links)
• An efficient algorithm to decide whether a monoid presented by a regular Church-Rosser Thue system is a group (Q1123272) (← 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)
• Completing a finite special string-rewriting system on the congruence class of the empty word (Q1191634) (← links)
• Contributions of Ronald V. Book to the theory of string-rewriting systems (Q1274982) (← links)
• Computing presentations for subgroups of polycyclic groups and of context-free groups (Q1328439) (← links)
• Codes modulo finite monadic string-rewriting systems (Q1341747) (← links)
• Cancellativity in finitely presented semigroups (Q1824041) (← links)
• On the rational subsets of the free group (Q1924996) (← links)
• Cancellation rules and extended word problems (Q2266586) (← links)
• (Q3329652) (← links)
• Elements of Finite Order for Finite Monadic Church-Rosser Thue Systems (Q3708211) (← links)
• Commutativity in groups presented by finite Church-Rosser Thue systems (Q3794395) (← links)
• Church-Rosser systems with respect to formal languages (Q3796797) (← links)
• The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems (Q4013403) (← links)
• DECISION AND SEPARABILITY PROBLEMS FOR BAUMSLAG–SOLITAR SEMIGROUPS (Q4786311) (← links)