The following pages link to Systems of reductions (Q1098283):
Displaying 30 items.
- A finitely presented monoid which has solvable word problem but has no regular complete presentation (Q673144) (← 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)
- A complete rewriting system for a monoid of tree transformation classes (Q918216) (← links)
- Reductions in tree replacement systems (Q1082092) (← links)
- It is undecidable whether a finite special string-rewriting system presents a group (Q1184861) (← links)
- When is an extension of a specification consistent? Decidable and undecidable cases (Q1186708) (← links)
- The use of Knuth-Bendix methods to solve the word problem in automatic groups (Q1192222) (← links)
- New methods for using Cayley graphs in interconnection networks (Q1199417) (← links)
- Deciding embeddability of partial groupoids into semigroups (Q1293382) (← links)
- Buchberger's algorithm: The term rewriter's point of view (Q1350495) (← links)
- Interaction systems II: The practice of optimal reductions (Q1350498) (← links)
- Free products with amalgamation of monoids (Q1380048) (← links)
- An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942) (← links)
- Infinite complete group presentations (Q1916428) (← links)
- Reduction operators and completion of rewriting systems (Q2399863) (← links)
- One-pass reductions (Q2820785) (← links)
- Reductions to simple fusion systems (Q2980182) (← links)
- (Q3637722) (← links)
- Reducibility Relationships Between Decision Problems for System Functions (Q3791141) (← links)
- Confluent string rewriting (Q3994922) (← links)
- The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems (Q4013403) (← links)
- Finite complete rewriting systems for groups (Q4384697) (← links)
- ON THE ZAPPA-SZÉP PRODUCT (Q4678650) (← links)
- On a graph connecting hyperbinary expansions (Q4985650) (← links)
- Open problems in rewriting (Q5055780) (← links)
- Applying term rewriting methods to finite groups (Q5096205) (← links)
- Semigroups satisfying x m+n = x n (Q5881194) (← links)
- Simplifications of Uniform Expressions Specified by Systems (Q6169899) (← links)
- Proof transformation for non-compatible rewriting (Q6560375) (← links)
