Pages that link to "Item:Q3802638"

The following pages link to A note on generating binary trees in<i>A</i>-order and<i>B</i>-order (Q3802638):

Displaying 24 items.

• Two shortest path metrics on well-formed parentheses strings (Q286951) (← links)
• A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words (Q866549) (← links)
• Generating t-ary trees in A-order (Q1104107) (← links)
• Loopless generation of \(k\)-ary tree sequences (Q1339380) (← links)
• Rational languages defined with a non-associative concatenation (Q1575941) (← links)
• On generating \(k\)-ary trees in computer representation (Q1603407) (← links)
• The number of coverings in four catalan lattices (Q2710772) (← links)
• CONSTANT-MEMORY ITERATIVE GENERATION OF SPECIAL STRINGS REPRESENTING BINARY TREES (Q2909202) (← links)
• On the generation of<i>P</i>-sequences (Q3210910) (← links)
• Parallel generation of í-ary trees with ballot-sequences (Q3410896) (← links)
• A new algorithm for generation of different types of RNA (Q3568449) (← links)
• Ranking and Unranking of Non-regular Trees (Q3792254) (← links)
• Generating trees with<i>n</i>nodes and<i>m</i>leaves (Q3805926) (← links)
• Generation of binary trees from (0-1) codes (Q3989787) (← links)
• Coding Binary Trees by Words over an Alphabet with Four Letters (Q4024145) (← links)
• On the generation of binary trees in<i>A</i>-order (Q4254656) (← links)
• On the generation of binary trees from (0–1) codes (Q4256127) (← links)
• A note on the generation of binary trees (Q4285646) (← links)
• Generating binary trees in A-order from codewords defined on a four-letter alphabet (Q4321109) (← links)
• Generation of<i>t</i>-ary trees with Ballot-sequences^* (Q4462115) (← links)
• Matchings In Three Catalan Lattices (Q4805933) (← links)
• (Q5013818) (← links)
• Chains with Small Intervals in the Lattice of Binary Paths (Q5212152) (← links)
• Parallel algorithms for generating combinatorial objects on linear processor arrays with reconfigurable bus systems. (Q5955805) (← links)