Pages that link to "Item:Q1162144"

The following pages link to Testing for the Church-Rosser property (Q1162144):

Displaying 27 items.

• Decidable sentences of Church-Rosser congruences (Q593775) (← links)
• Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group (Q760506) (← links)
• The undecidability of the preperfectness of Thue systems (Q797574) (← links)
• Homogeneous Thue systems and the Church-Rosser property (Q798317) (← links)
• Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
• An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems (Q1057263) (← links)
• The Church-Rosser property and special Thue systems (Q1071759) (← links)
• Reductions in tree replacement systems (Q1082092) (← links)
• Thue systems as rewriting systems (Q1099642) (← links)
• Rewriting systems and word problems in a free partially commutative monoid (Q1102124) (← links)
• On deciding the confluence of a finite string-rewriting system on a given congruence class (Q1102946) (← links)
• Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule (Q1107523) (← links)
• NTS grammars and Church-Rosser systems (Q1159985) (← links)
• Monadic Thue systems (Q1165842) (← links)
• When is a monoid a group? The Church-Rosser case is tractable (Q1166924) (← links)
• Contributions of Ronald V. Book to the theory of string-rewriting systems (Q1274982) (← links)
• Cancellativity in finitely presented semigroups (Q1824041) (← links)
• Infinite regular Thue systems (Q1839248) (← links)
• Undecidable questions related to Church-Rosser Thue systems (Q1839249) (← links)
• Confluence problems for trace rewriting systems (Q1854457) (← links)
• It is decidable whether a monadic thue system is canonical over a regular set (Q3210188) (← links)
• A note on thue systems with a single defining relation (Q3735697) (← 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)
• A note on special thue systems with a single defining relation (Q4740555) (← links)
• On confluence of one-rule trace-rewriting systems (Q4841768) (← links)
• Equational Theorem Proving for Clauses over Strings (Q6118747) (← links)