Generating a Gray code for P-sequences

DOI10.1023/A:1015622720041zbMATH Open1064.68080MaRDI QIDQ1868262FDOQ1868262

Authors: Vincent Vajnovszki 

Publication date: 27 April 2003

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

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

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)

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
• Title not available (Why is that?)
• 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)