On one algorithm of computing the inverse Laplace–Galois transformation

The proposed algorithm of computing the inverse Laplace–Galois transformation does not require expansion of the original image into most elementary fractions over Galois fields and leads to a modular original function from coefficients in the numerator and denominator of the direct Laplace–Galois transformation. Examples are given.