Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time
From MaRDI portal
Publication:4217306
DOI10.1006/jagm.1998.0960zbMath0936.68115OpenAlexW1979806321MaRDI QIDQ4217306
Publication date: 7 March 1999
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1998.0960
Related Items (4)
Matchings In Three Catalan Lattices ⋮ A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths
This page was built for publication: Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time
