Work

Permutation complexity of the fixed points of some uniform binary morphisms

Year: 2011

Type: article

Abstract: An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.63.32

Author: Alexander Valyuzhenich

Institution: Novosibirsk State University

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2090308276

FWCI: 0.297

Cites: 3

Cited by: 1

Related to: 10