A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
From MaRDI portal
Publication:866549
DOI10.1016/J.JDA.2005.07.003zbMATH Open1109.68083OpenAlexW2016908520MaRDI QIDQ866549FDOQ866549
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
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
- Generating binary trees by transpositions
- A note on generating binary trees inA-order andB-order
- An algorithm for generating subsets of fixed size with a strong minimal change property
- An Eades-McKay algorithm for well-formed parentheses strings
- Title not available (Why is that?)
- A Loopless Gray-Code Algorithm for Listing k-ary Trees
- Title not available (Why is that?)
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Title not available (Why is that?)
- Efficient generation of the binary reflected gray code and its applications
- Gray codes for involutions
- Correspondences between plane trees and binary sequences
- Adjacent interchange generation of combinations
- Generating t-Ary Trees Lexicographically
- Title not available (Why is that?)
- A loopless algorithm for generating the permutations of a multiset
- Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange
- Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time
Cited In (12)
- 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
- Title not available (Why is that?)
- 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
- Ranking and loopless generation of \(k\)-ary Dyck words in cool-lex 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)
