Efficient generation of restricted growth words

DOI10.1016/j.ipl.2013.05.008zbMath1284.68488OpenAlexW2078856322MaRDI QIDQ2444851

Toufik Mansour, Vicentiu Vajnovszki

Publication date: 11 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.05.008

zbMATH Keywords

algorithmsGray codesrestricted growth functions/words

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Other types of codes (94B60)

Related Items (8)

Shedding light on words ⋮ How testing helps to diagnose proof failures ⋮ Descent distribution on Catalan words avoiding ordered pairs of relations ⋮ Consecutive patterns in Catalan words and the descent distribution ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Descent distribution on Catalan words avoiding a pattern of length at most three ⋮ Counting lattice points on bargraphs of Catalan words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the loopless generation of binary tree sequences
• Some enumerative results related to ascent sequences
• New permutation coding and equidistribution of set-valued statistics
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• A general exhaustive generation algorithm for Gray structures
• Generalized permutation patterns and a classification of the Mahonian statistics
• Lehmer code transforms and Mahonian statistics on permutations
• Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
• A Survey of Combinatorial Gray Codes

This page was built for publication: Efficient generation of restricted growth words