The Identification Problem for Transcendental Functions

In this article algorithmic methods are presented that have essentially been introduced into computer algebra within the last decade. The main ideas are due to Stanley [34] and Zeilberger [40]--[43]. Some of them had already been discovered in the last century (see e. g. [4]--[5]), but because of the complexity of the underlying algorithms have fallen into oblivion. The combination of these ideas leads to a solution of the identification problem for a large class of transcendental functions. We present implementations of these algorithms in computer algebra systems