Gray visiting Motzkins

DOI10.1007/s00236-002-0097-0zbMath1018.05002OpenAlexW1981015994MaRDI QIDQ1403332

Vicentiu Vajnovszki

Publication date: 1 September 2003

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-002-0097-0

zbMATH Keywords

shuffleGray codeMotzkin wordsDyck wordsSchröder words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05) Combinatorial codes (94B25)

Related Items (8)

Gray code for permutations with a fixed number of cycles ⋮ Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions ⋮ Prefix partitioned Gray codes for particular cross-bifix-free sets ⋮ Combinatorial Gray codes for classes of pattern avoiding permutations ⋮ More restrictive Gray codes for some classes of pattern avoiding permutations ⋮ A general exhaustive generation algorithm for Gray structures ⋮ On the reconstruction of a Motzkin Tree from its code ⋮ Gray code for derangements

This page was built for publication: Gray visiting Motzkins