A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words (Q866549)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A loop-free two-close Gray-code algorithm for listing k-ary Dyck words |
scientific article; zbMATH DE number 5126393
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words |
scientific article; zbMATH DE number 5126393 |
Statements
A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words (English)
0 references
14 February 2007
0 references
Gray code
0 references
\(k\)-ary Dyck words
0 references
two-close loop-free algorithm
0 references
0 references
0 references
0.8301079869270325
0 references
0.802846372127533
0 references
0.7963863611221313
0 references
0.7904905676841736
0 references
0.7803180813789368
0 references
