Algorithms. 31. PERMUT. Simple algorithm generating all permutations

Zdeněk Režný; Evžen Kindler

Displaying similar documents to “Algorithms. 31. PERMUT. Simple algorithm generating all permutations”

Permutations generated by a stack of depth 2 and an infinite stack in series.

Elder, Murray (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Words over an ordered alphabet and suffix permutations

Jean-Pierre Duval, Arnaud Lefebvre (2002)

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

Similarity:

Given an ordered alphabet and a permutation, according to the lexicographic order, on the set of suffixes of a word $w$ , we present in this article a linear time and space method to determine whether a word $w^{'}$ has the same permutation on its suffixes. Using this method, we are then also able to build the class of all the words having the same permutation on their suffixes, first of all the smallest one. Finally, we note that this work can lead to a method for generating a Lyndon word randomly...

Counting occurrences of 132 in an even permutation.

Mansour, Toufik (2004)

International Journal of Mathematics and Mathematical Sciences

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.