A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words

DOI10.1016/j.jda.2005.07.003zbMath1109.68083OpenAlexW2016908520MaRDI QIDQ866549

N. E. Zubov

Publication date: 14 February 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2005.07.003

zbMATH Keywords

Gray code\(k\)-ary Dyck wordstwo-close loop-free algorithm

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Inside the binary reflected gray code: flip-swap languages in 2-gray code order ⋮ Cool-lex order and \(k\)-ary Catalan structures ⋮ Flip-swap languages in binary reflected Gray code order ⋮ Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions ⋮ Restricted compositions and permutations: from old to new Gray codes ⋮ Unnamed Item ⋮ The coolest way to generate combinations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Eades-McKay algorithm for well-formed parentheses strings
• An algorithm for generating subsets of fixed size with a strong minimal change property
• Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange
• A loopless algorithm for generating the permutations of a multiset
• Generating binary trees by transpositions
• A note on generating binary trees inA-order andB-order
• Efficient generation of the binary reflected gray code and its applications
• Generating t-Ary Trees Lexicographically
• Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time
• A Loopless Gray-Code Algorithm for Listing k-ary Trees
• Adjacent interchange generation of combinations
• Correspondences between plane trees and binary sequences
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

This page was built for publication: A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words