Automatic Generation and Solving of mathematical expressions

In this book we propose methodologies for implementation and operation of the CAS systems, where it is generally organized in two parts, namely the proposal of two grammar-based methodological approaches as for automatic solving of math problems and generating template-based mathematical expressions. The first part of the study presents a methodology for the step-by-step solution of problems, which can be incorporated into a CAS-like system. The aim is to show all the intermediate evaluation steps of mathematical expressions from the start to the end of the solution. Simplification is done by applying various transformations on original problem. The other part of the study addresses the production of new questions using the template expressions that are derived from the solved questions or entered by the users. With the parametric determination of values for such limitations, some templates can be dynamically constructed for the automatic generation of mathematical expressions and represented implemented in the form of classes.

Autorentext

He got his B.Sc.E degree in Computer Engineering, M.Sc.E degree in Information Technology at IRAN, and PhD. degree in 2015 in Computer Engineering at Turkey. His primary research area is Symbolic Computing, Functional Programming and Cryptography. Since 2015, he has been working as an Assist. Prof. at Department of Computer Engineering in TURKEY.