RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2013 Number 3(21), Pages 105–111 (Mi pdm422)

Computational Methods in Discrete Mathematics

About linear and affine equivalence of substitutions

I. V. Pankratov

Tomsk State University, Tomsk, Russia

Abstract: The results of computer experiments with a software implementation of algorithms for determining the linear and affine equivalence of substitutions are presented. The detailed description of the algorithms is given. Experimental operation time of the algorithms is compared with the theoretical complexity of the problem.

Keywords: linear equivalence, affine equivalence, substitution.

UDC: 519.6



© Steklov Math. Inst. of RAS, 2024