A dynamic programming method for building free algebras
DOI10.1016/0898-1221(91)90148-WzbMATH Open0753.17001OpenAlexW2030729618MaRDI QIDQ1192202FDOQ1192202
Authors: David Pokrass Jacobs, Irvin Roy Hentzel
Publication date: 27 September 1992
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(91)90148-w
Recommendations
dynamic programmingalgorithmfree nonassociative algebranonassociative polynomialvariety of commutative fourth-power-associative algebras
Symbolic computation and algebraic computation (68W30) Free nonassociative algebras (17A50) Power-associative rings (17A05) Computational methods for problems pertaining to nonassociative rings and algebras (17-08)
Cites Work
Cited In (14)
- On the variety determined by symmetric quadratic algebras
- Rings with (a, b, c) = (a, c, b) and (a, [b, c]d) = 0: a case study using albert
- A free construction of dynamic terms
- Special identities for Bol algebras
- Title not available (Why is that?)
- Probabilistic checking of associativity in algebras
- On the construction of free algebras for equational systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving the word problem for two classes of non-associative rings by rewriting
- Title not available (Why is that?)
- Nonassociative polynomial identities, Young tableaux and computers
- An algorithm for free algebras.
- Nonassociative structures on polynomial algebras arising from bio-operations on formal languages: an application of computer algebra to nonassociative systems
This page was built for publication: A dynamic programming method for building free algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1192202)