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

DOI10.1016/J.JDA.2005.07.003MaRDI QIDQ866549zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Ranking and loopless generation of \(k\)-ary Dyck words in cool-lex order
• Efficient loopless generation of Gray codes for \(k\)-ary trees.
• Loopless generation of Gray codes for \(k\)-ary trees
• A Loopless Gray-Code Algorithm for Listing k-ary Trees
• Gray codes and overlap cycles for restricted weight words

Cites work

• scientific article; zbMATH DE number 1354135 (Why is no real title available?)
• scientific article; zbMATH DE number 2040940 (Why is no real title available?)
• scientific article; zbMATH DE number 822743 (Why is no real title available?)
• scientific article; zbMATH DE number 4195954 (Why is no real title available?)
• A Loopless Gray-Code Algorithm for Listing k-ary Trees
• A loopless algorithm for generating the permutations of a multiset
• A note on generating binary trees inA-order andB-order
• Adjacent interchange generation of combinations
• An Eades-McKay algorithm for well-formed parentheses strings
• An algorithm for generating subsets of fixed size with a strong minimal change property
• Correspondences between plane trees and binary sequences
• Efficient generation of the binary reflected gray code and its applications
• Generating t-Ary Trees Lexicographically
• Generating binary trees by transpositions
• Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time
• Gray codes for involutions
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange

Cited in

(12)

• Ranking and loopless generation of \(k\)-ary Dyck words in cool-lex order
• Cool-lex order and k-ary Catalan structures
• Flip-swap languages in binary reflected Gray code order
• Greedy Gray codes for Dyck words and ballot sequences
• Restricted compositions and permutations: from old to new Gray codes
• Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
• scientific article; zbMATH DE number 5975298 (Why is no real title available?)
• Restricting Dyck paths and 312-avoiding permutations
• Computing and Combinatorics
• Gray visiting Motzkins
• The coolest way to generate combinations
• Inside the binary reflected gray code: flip-swap languages in 2-gray code order

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866549)