Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports]
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



Sib. Èlektron. Mat. Izv.:
Year:
Volume:
Issue:
Page:
Find






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


Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2015, Volume 12, Pages 64–79
DOI: https://doi.org/10.17377/semi.2015.12.006
(Mi semr569)
 

Discrete mathematics and mathematical cybernetics

On permutation complexity of fixed points of some nonuniform binary morphisms

A. A. Valuzhenich

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
References:
Abstract: We study properties of infinite permutations generated by fixed points of morphism $\varphi(0)=01^{k},\varphi(1)=0$ for $k\geq{2}$, and find the formula for their factor complexity.
Keywords: permutation complexity, infinite permutation, morphism.
Received September 17, 2012, published February 1, 2015
Document Type: Article
UDC: 519.1
MSC: 68R15
Language: Russian
Citation: A. A. Valuzhenich, “On permutation complexity of fixed points of some nonuniform binary morphisms”, Sib. Èlektron. Mat. Izv., 12 (2015), 64–79
Citation in format AMSBIB
\Bibitem{Val15}
\by A.~A.~Valuzhenich
\paper On permutation complexity of fixed points of some nonuniform binary morphisms
\jour Sib. \`Elektron. Mat. Izv.
\yr 2015
\vol 12
\pages 64--79
\mathnet{http://mi.mathnet.ru/semr569}
\crossref{https://doi.org/10.17377/semi.2015.12.006}
Linking options:
  • https://www.mathnet.ru/eng/semr569
  • https://www.mathnet.ru/eng/semr/v12/p64
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:193
    Full-text PDF :54
    References:27
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024