In order to facilitate symbolic computations with systems of linear functional equations (e.g. integrodifferential, differential timedelay, recurrence, ...), we require an algebraic framework for such systems which enables effective computations in corresponding rings of operators. For finding such frameworks, instead of using parametrized Gröbner bases in free algebras as has been done so far in the literature, we exploit and generalize Bergmans basisfree analog in tensor rings, which often allows for a finite reduction system with unique normal forms. In short, we propose a general algorithmic approach to noncommutative operator algebras generated by additive operators. In this thesis, a selfcontained treatment of reduction systems in tensor rings including preliminaries such as tensor product of bimodules, tensor rings, and basics of term rewriting is presented. We apply our generalization of Bergman's setting to construct the ring of integrodifferential operators (IDO) having (noncommutative) matrix coefficients. Moreover, we extend this ring to the ring of integrodifferential operators with linear substitutions (IDOLS). As a new instance of the tensor setting, we construct the ring of inversive sumdifference operators (SDO). For finding normal forms in these rings, we complete their defining reduction systems to obtain confluent ones. These normal forms allow to solve operator equations by ansatz. We show that, by applying tensor reduction systems, results like the method of variation of constants in the ring of IDO and the method of steps in the ring of IDOLS can be found and proven in an automated way. Using normal forms in the ring of IDO, we illustrate how to compute Green's operators for firstorder systems of linear ordinary boundary problems. Moreover, in the ring of IDOLS, we partly automatize certain computations related to differential timedelay systems, e.g. Artsteins transformation and its generalization. Using the Mathematica package TenReS, we implement the rings of IDO, IDOLS, SDO, and corresponding normal forms. We also use these implementations to perform computations for the applications treated in this thesis.
