scientific article
From MaRDI portal
Publication:3992832
zbMath0682.68034MaRDI QIDQ3992832
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Abstract data types; algebraic specification (68Q65) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Thue and Post systems, etc. (03D03)
Related Items
A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier), Incremental termination proofs and the length of derivations, Simulating Buchberger's algorithm by Knuth-Bendix completion, Buchberger's algorithm: The term rewriter's point of view, On deciding the confluence of a finite string-rewriting system on a given congruence class, History and basic features of the critical-pair/completion procedure, Critical pair criteria for completion, Buchberger's algorithm: The term rewriter's point of view, Applying term rewriting methods to finite groups, Algorithms and topology of Cayley graphs for groups., An upper bound on the derivational complexity of Knuth-Bendix orderings., Proof theory of higher-order equations: Conservativity, normal forms and term rewriting., Word problem and parabolic subgroups in Dyer groups, About the descriptive power of certain classes of finite string-rewriting systems, An algorithm for the construction of matrix representations for finitely presented non-commutative algebras, Superposition with completely built-in abelian groups, Theorem proving with group presentations: Examples and questions, On weakly confluent monadic string-rewriting systems, New methods for using Cayley graphs in interconnection networks, Algebraic aspects of an ordered band arising in nonlinear signal processing, Some relations on prefix reversal generators of the symmetric and hyperoctahedral group, A polynomial algorithm testing partial confluence of basic semi-Thue systems, Combinable Extensions of Abelian Groups, Rewriting systems in alternating knot groups with the Dehn presentation, On the logic of unification, REWRITING SYSTEMS IN ALTERNATING KNOT GROUPS, Deciding embeddability of partial groupoids into semigroups, Tilings as a programming exercise., Rewriting systems of Coxeter groups
