Skip to main content
Skip to search
Open Access Journals
Sign in
(new window)
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science
Sign in
(new window)
Articles & Issues
All articles
All accepted articles
All volumes
Last volume
Sections
Special issues
Authors
About
The journal
Indexing
Boards
Publish
For authors
Ethical charter
Submit
Home > Articles & Issues >
Articles >
On permutation compl ...
Article
On permutation complexity of fixed points of some uniform binary morphisms
Alexandr Valyuzhenich
(1)
(1) Department of Mechanics and Mathematics [Novosibisrk]
Download article
Open on HAL
Cite
Metadata
TEI
Dublin Core
Crossref
ZB Jats
DOAJ
BibTeX
CSL
OpenAire
JSON
Share
Bluesky
Facebook
LinkedIn
Mail
WhatsApp
X
Publication details
Imported on
September 11, 2012
Published on
July 28, 2014
Last modified on
March 31, 2025
Volume 16
vol. 16:3
Combinatorics
DOI
10.46298/dmtcs.2096
License
https://about.hal.science/hal-authorisation-v1
Indicators
789
Views
1073
Downloads
On permutation complexity of fixed points of some uniform binary morphisms
Alexandr Valyuzhenich
(1)
(1) Department of Mechanics and Mathematics [Novosibisrk]
Abstract
We study properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
Keywords
[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Infinite permutation
Factor complexity
Morphism
Preview
Loading PDF preview...
(1) (1)