A new algorithm of symbolic expression simplification based on right-threaded binary tree

DOI

10.2991/nceece-15.2016.294How to use a DOI?

Keywords

Right-thread Binary Tree; Postfix Expression; Symbolic Expression Simplification

Abstract

Considering that it’s difficult to dealing with symbolic expressions which are stored in the form of strings, we put forward an idea that the symbolic expression is stored in a right-thread binary tree, and we minimize the right-thread binary tree so that the symbolic expression could be simplified. For a right-threaded binary tree that represents a symbolic expression, we traverse its nodes in order of its corresponding postfix expression. During the traversal, we simplify the expression. The Algorithm not only minimizes the tree, but also transforms the tree into an expression string. Experiments show that most symbolic expressions can be simplified by the method.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Dechuan Yang
AU  - Zeliang Song
AU  - Ri Yu
AU  - Xihe Jiang
AU  - Hongwei Zhao
PY  - 2015/12
DA  - 2015/12
TI  - A new algorithm of symbolic expression simplification based on right-threaded binary tree
BT  - Proceedings of the 2015 4th National Conference on Electrical, Electronics and Computer Engineering
PB  - Atlantis Press
SP  - 1630
EP  - 1633
SN  - 2352-5401
UR  - https://doi.org/10.2991/nceece-15.2016.294
DO  - 10.2991/nceece-15.2016.294
ID  - Yang2015/12
ER  -