A shift Gray code for fixed-content Łukasiewicz words

DOI10.1007/978-3-031-06678-8_28OpenAlexW4285140751MaRDI QIDQ2169973

Paul W. Lapey, Aaron Williams

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-06678-8_28

zbMATH Keywords

Gray codeDyck wordcool-lex orderŁukasiewicz pathfixed-contentMotzkin wordŁukasiewicz word

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Flip-swap languages in binary reflected Gray code order

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Binary bubble languages and cool-lex order
• The coolest way to generate combinations
• Enumerations of ordered trees
• A loopless algorithm for generating binary tree sequences
• Cool-lex order and \(k\)-ary Catalan structures
• The kernel method for lattice paths below a line of rational slope
• Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order
• Generating Trees and Other Combinatorial Objects Lexicographically
• A Survey of Combinatorial Gray Codes
• A New Coding Algorithm for Trees
• Loopless Generation of Trees with Specified Degrees
• Catalan Numbers
• Computing and Combinatorics

This page was built for publication: A shift Gray code for fixed-content Łukasiewicz words