Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Prikladnaya Diskretnaya Matematika, 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
Full-text PDF (592 kB)
References:
PDF
HTML
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.
Document Type: Article
UDC: 519.6
Language: Russian
Citation: I. V. Pankratov, “About linear and affine equivalence of substitutions”, Prikl. Diskr. Mat., 2013, no. 3(21), 105–111
Citation in format AMSBIB
\Bibitem{Pan13}
\by I.~V.~Pankratov
\paper About linear and affine equivalence of substitutions
\jour Prikl. Diskr. Mat.
\yr 2013
\issue 3(21)
\pages 105--111
\mathnet{http://mi.mathnet.ru/pdm422}
Linking options:
  • https://www.mathnet.ru/eng/pdm422
  • https://www.mathnet.ru/eng/pdm/y2013/i3/p105
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:260
    Full-text PDF :268
    References:53
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024