Enumeration of factorizable multi-dimensional permutations.
Zhang, Hao, Gildea, Daniel (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Zhang, Hao, Gildea, Daniel (2007)
Journal of Integer Sequences [electronic only]
Similarity:
A. Panayotopoulos, A. Sapounakis (1992)
Mathématiques et Sciences Humaines
Similarity:
Every binary tree is associated to a permutation with repetitions, which determines it uniquely. Two operations are introduced and used for the construction of the set of all binary trees. The set of all permutations which correspond to a given binary tree is determined and its cardinal number is evaluated.
Lipson, Mark (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Anne Micheli, Dominique Rossin (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
There exists a bijection between one-stack sortable permutations (permutations which avoid the pattern ) and rooted plane trees. We define an edit distance between permutations which is consistent with the standard edit distance between trees. This one-to-one correspondence yields a polynomial algorithm for the subpermutation problem for pattern-avoiding permutations. Moreover, we obtain the generating function of the edit distance between ordered unlabeled trees and some special ones. For...
Bóna, Miklós (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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...
Vatter, Vincent R. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Barcucci, Elena, Del Lungo, Alberto, Pergola, Elisa, Pinzani, Renzo (2000)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Vladimir Baltić (2012)
The Yugoslav Journal of Operations Research
Similarity:
Lewis, Joel Brewster (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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...
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...
Albert, Michael H., Linton, Steve, Ruskuc, Nik (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tomáš Flouri, Jan Janoušek, Bořivoj Melichar (2010)
Computer Science and Information Systems
Similarity: