On permutation complexity of fixed points of some uniform binary morphisms

On permutation complexity of fixed points of some uniform binary morphisms

Combinatorics

Bibliographic Details
Main Author: Alexandr Valyuzhenich
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2014-07-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
infinite permutation
factor complexity
morphism
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:https://dmtcs.episciences.org/2096/pdf
Description
Summary:Combinatorics
ISSN:1365-8050

Similar Items