Generating a Gray code for P-sequences

DOI10.1023/A:1015622720041MaRDI QIDQ1868262zbMATH OpenFDO

Authors Vincent Vajnovszki

Publication date 27 April 2003

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1015622720041

zbMATH Keywords

loopless generating algorithmsparentheses stringsGray codesP-sequences

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Prefix, length-variable, comma-free codes (94A45) Combinatorics on words (68R15)

Recommendations

• Binary tree gray codes
• On the loopless generation of binary tree sequences
• scientific article; zbMATH DE number 5116825
• On the generation ofP-sequences
• A Loopless Gray-Code Algorithm for Listing k-ary Trees

Cited in

(8)

• A general exhaustive generation algorithm for Gray structures
• Binary tree gray codes
• On the loopless generation of binary tree sequences
• A loopless algorithm for generating multiple binary tree sequences simultaneously
• scientific article; zbMATH DE number 1665457 (Why is no real title available?)
• A loopless algorithm for generating multiple binary tree sequences simultaneously
• On the exhaustive generation of generalized ballot sequences in lexicographic and Gray code order
• Gray coding cubic planar maps

This page was built for publication: Generating a Gray code for P-sequences

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