Implementation of the Nielsen algorithm in the algebraic programming system APS-1

DOI10.1007/BF02367756MaRDI QIDQ1905209zbMATH OpenFDO

Authors Yanyan Li

Publication date 8 February 1996

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

canonical formsfinitely generated free groupsrewriting rulesirreducible wordsNielsen reduction processNielsen's algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Free nonabelian groups (20E05) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04)

Recommendations

• Implementation of some algorithms of combinatorial group theory in the algebraic programming system APS-1
• Algorithms for implementation of solutions of systems of linear algebraic equations
• scientific article; zbMATH DE number 1273691
• An approximate algorithm for nonlinear integer programming
• An approximate algorithm for nonlinear integer programming
• Application of a structured LISP system to computer algebra
• Computational algebra with APL
• A partial enumeration algorithm for pure nonlinear integer programming

Cited in

(3)

• Implementation of some algorithms of combinatorial group theory in the algebraic programming system APS-1
• APS-1
• Efficiency of certain algorithms of combinatorial group theory

Describes a project that uses

Uses Software

• APS

This page was built for publication: Implementation of the Nielsen algorithm in the algebraic programming system APS-1

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1905209)