Displaying similar documents to “Words over an ordered alphabet and suffix permutations”

On automatic infinite permutations

Anna Frid, Luca Zamboni (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

An infinite permutation is a linear ordering of N. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this paper, we try to extend to permutations the notion of automaticity. As we shall show, the standard definitions which are equivalent in the case of words are not equivalent in the context of permutations. We investigate the relationships between these definitions and...

On automatic infinite permutations

Anna Frid, Luca Zamboni (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

An infinite permutation is a linear ordering of N. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this paper, we try to extend to permutations the notion of automaticity. As we shall show, the standard definitions which are equivalent in the case of words are not equivalent in the context of permutations. We investigate...

On automatic infinite permutations

Anna Frid, Luca Zamboni (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

An infinite permutation is a linear ordering of N. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this paper, we try to extend to permutations the notion of automaticity. As we shall show, the standard definitions which are equivalent in the case of words are not equivalent in the context of permutations. We investigate...

Growth rates for subclasses of Av(321).

Albert, M.H., Atkinson, M.D., Brignall, R., Ruškuc, N., Smith, Rebecca, West, J. (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Axial permutations of ω²

Paweł Klinga (2016)

Colloquium Mathematicae

Similarity:

We prove that every permutation of ω² is a composition of a finite number of axial permutations, where each axial permutation moves only a finite number of elements on each axis.