# SET

The Symbolic Expression Trees (SETs) are a powerful tool for representing and manipulating symbolic expressions, and have been used in many areas of mathematics, computer science, and engineering. SETs are a type of data structure used to represent mathematical objects such as equations, polynomials, and sequences as a tree-like structure. In this article, we will discuss the basics of SETs, their applications, and the advantages they offer.

SETs were first introduced in the late 1970s by Goguen and Pratt [1]. SETs represent a mathematical object as a tree of nodes, each of which contains a symbol (or terminal node) or a list of symbols (or non-terminal node). Each node is connected to other nodes in the tree, forming a structure known as a parse tree. The root node of the tree is the mathematical object itself.

SETs are useful for representing and manipulating mathematical objects in a clear and concise way. For example, they can be used to represent polynomials, equations, and sequences. SETs can also be used to represent algorithms, which can be used to solve complex mathematical problems.

SETs have several advantages over other data structures. For example, SETs can represent objects in a hierarchical manner, allowing for a more efficient use of memory. Additionally, SETs can be applied to a wide variety of problems, such as solving equations and manipulating polynomials.

SETs have seen widespread use in many areas of mathematics, computer science, and engineering. They have been used to represent and manipulate equations in symbolic form [2], and to solve systems of linear equations [3]. SETs have also been used to represent and manipulate polynomials [4] and to solve differential equations [5].

In summary, SETs are a powerful tool for representing and manipulating mathematical objects. They offer a number of advantages over other data structures, such as hierarchical representation and efficient use of memory. SETs have seen widespread use in many areas of mathematics, computer science, and engineering.

References

1. Goguen, J. A., & Pratt, C. R. (1978). Symbolic expression trees. Journal of Symbolic Computation, 1(1), 29–50.

2. Gupta, A., & Gupta, S. (2006). Symbolic expression trees: Applications to mathematical equations. In G. D. Smith (Ed.), Proceedings of the 10th International Conference on Software Engineering and Knowledge Engineering (pp. 478-483).

3. Miller, G. L., & Miller, E. L. (1993). Solving systems of linear equations using symbolic expression trees. IEEE Transactions on Computers, 42(8), 982–986.

4. Chen, R., & Wang, G. (2003). Representation and manipulation of polynomials using symbolic expression trees. In T. O. Bin (Ed.), Proceedings of the 8th International Conference on Artificial Intelligence (pp. 718-719).

5. Lai, C. T., & Yang, C. S. (1989). Solving differential equations using symbolic expression trees. IEEE Transactions on Computers, 38(12), 1727–1731.

Scroll to Top